Yem JinBen yanjinbin

## P2483.cpp
#include <queue>
#include <iostream>
#include <algorithm>

using namespace std;
const int N = 5005, M = 2e5 + 5;
int n, m;
double E;

struct data { //A* 结构体

## heuristic_search.cpp
#include <algorithm>
#include <iostream>
// https://oi-wiki.org/search/heuristic/
// heuristic-search 启发式搜索
using namespace std;
const int N = 105;
int m, t, ans;
struct Node {
	int time, value;
	double f;

## heuristic_search.cpp
#include <algorithm>
#include <iostream>
// https://oi-wiki.org/search/heuristic/
// heuristic-search 启发式搜索
using namespace std;
const int N = 105;
int m, t, ans;
struct Node {
	int time, value;
	double f;

## heuristic_search.cpp
#include <algorithm>
#include <iostream>
// https://oi-wiki.org/search/heuristic/
// heuristic-search 启发式搜索
using namespace std;
const int N = 105;
int m, t, ans;
struct Node {
	int time, value;
	double f;

## heuristic_search.cpp
#include <algorithm>
#include <iostream>
// https://oi-wiki.org/search/heuristic/
// heuristic-search 启发式搜索
using namespace std;
const int N = 105;
int m, t, ans;
struct Node {
	int time, value;
	double f;

## LC 76.java
```java


  public String minimumWindow01(String s, String t) {
        int l = 0, r = 0, N = s.length() , start = 0, minLen = Integer.MAX_VALUE;
        Map<Character, Integer> needs = new HashMap();
        for (char c : t.toCharArray()) {
            needs.put(c, needs.getOrDefault(c, 0) + 1);
        }
        Map<Character, Integer> windows = new HashMap();

## gist:750e57f4d85734b3a9b5b357840af90f

https://www.1point3acres.com/bbs/thread-564384-1-1.html
二维矩阵旋转

https://www.1point3acres.com/bbs/thread-475376-1-1.html
单链表，绝对值从大到小排列，现在让变成按照正常的值从大到小排
https://www.geeksforgeeks.org/sort-linked-list-already-sorted-absolute-values/


https://www.1point3acres.com/bbs/thread-529016-1-1.html

## GPState.go
// defined constants
const (
	// G status
	//
	// Beyond indicating the general state of a G, the G status
	// acts like a lock on the goroutine's stack (and hence its
	// ability to execute user code).
	//
	// If you add to this list, add to the list
	// of "okay during garbage collection" status

## select

      
              1 file
            
          
              0 forks
            
          
              2 comments
            
          
              0 stars
            
          
                yanjinbin
                / select
            
            
              Last active
              November 17, 2019 08:28
            
              
                Select基本逻辑图
              
          
              We couldn’t find that file to show.
              
            
## 111
1111
	#include <queue>
	#include <iostream>
	#include <algorithm>

	using namespace std;
	const int N = 5005, M = 2e5 + 5;
	int n, m;
	double E;

	struct data { //A* 结构体
	#include <algorithm>
	#include <iostream>
	// https://oi-wiki.org/search/heuristic/
	// heuristic-search 启发式搜索
	using namespace std;
	const int N = 105;
	int m, t, ans;
	struct Node {
	int time, value;
	double f;
	```java


	public String minimumWindow01(String s, String t) {
	int l = 0, r = 0, N = s.length() , start = 0, minLen = Integer.MAX_VALUE;
	Map<Character, Integer> needs = new HashMap();
	for (char c : t.toCharArray()) {
	needs.put(c, needs.getOrDefault(c, 0) + 1);
	}
	Map<Character, Integer> windows = new HashMap();

	https://www.1point3acres.com/bbs/thread-564384-1-1.html
	二维矩阵旋转

	https://www.1point3acres.com/bbs/thread-475376-1-1.html
	单链表，绝对值从大到小排列，现在让变成按照正常的值从大到小排
	https://www.geeksforgeeks.org/sort-linked-list-already-sorted-absolute-values/


	https://www.1point3acres.com/bbs/thread-529016-1-1.html
	// defined constants
	const (
	// G status
	//
	// Beyond indicating the general state of a G, the G status
	// acts like a lock on the goroutine's stack (and hence its
	// ability to execute user code).
	//
	// If you add to this list, add to the list
	// of "okay during garbage collection" status