This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <queue> | |
#include <iostream> | |
#include <algorithm> | |
using namespace std; | |
const int N = 5005, M = 2e5 + 5; | |
int n, m; | |
double E; | |
struct data { //A* 结构体 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#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; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#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; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#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; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#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; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
```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(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// 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 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
1111 |
NewerOlder