-
Notifications
You must be signed in to change notification settings - Fork 33
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
4 changed files
with
4 additions
and
4 deletions.
There are no files selected for viewing
Large diffs are not rendered by default.
Oops, something went wrong.
Large diffs are not rendered by default.
Oops, something went wrong.
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1 @@ | ||
[[1378748721,"Strongly Connected Component","强连通分量"],[492620472,"Concurrency","多线程"],[334724963,"Reservoir Sampling","水塘抽样"],[1615808600,"String","字符串"],[2300936473,"Two Pointers","双指针"],[2952532185,"Greedy","贪心"],[1618992015,"Monotonic Stack","单调栈"],[954837032,"Monotonic Queue","单调队列"],[3200621928,"Game Theory","博弈"],[2777070981,"Hash Table","哈希表"],[2745966228,"Divide and Conquer","分治"],[1597208551,"Graph","图"],[1315724598,"Simulation","模拟"],[3122227617,"Shell",""],[1432994735,"Math","数学"],[666045116,"Enumeration","枚举"],[2593860184,"Queue","队列"],[4013823363,"Heap (Priority Queue)","堆(优先队列)"],[3361825412,"Quickselect","快速选择"],[868588451,"Hash Function","哈希函数"],[2967599592,"Binary Search","二分查找"],[20600792,"Counting Sort","计数排序"],[4036243672,"Database","数据库"],[1303275809,"Minimum Spanning Tree","最小生成树"],[2465402031,"Backtracking","回溯"],[803820082,"Ordered Set","有序集合"],[2282267785,"Number Theory","数论"],[3152783174,"Shortest Path","最短路"],[882398702,"Breadth-First Search","广度优先搜索"],[604962628,"Binary Tree","二叉树"],[608099761,"Geometry","几何"],[3789650833,"Merge Sort","归并排序"],[3381359851,"Dynamic Programming","动态规划"],[851369480,"Bitmask","状态压缩"],[1858746375,"Recursion","递归"],[2981007068,"Combinatorics","组合数学"],[382270662,"Array","数组"],[1645884698,"Rolling Hash","滚动哈希"],[1631658827,"Depth-First Search","深度优先搜索"],[3988226293,"Tree","树"],[226253435,"Radix Sort","基数排序"],[3376788625,"Eulerian Circuit","欧拉回路"],[2720626878,"Doubly-Linked List","双向链表"],[1674020409,"Memoization","记忆化搜索"],[2947477999,"Sorting","排序"],[1808652384,"Binary Search Tree","二叉搜索树"],[4141685903,"Union Find","并查集"],[4116070215,"String Matching","字符串匹配"],[2604685700,"Counting","计数"],[110965111,"Brainteaser","脑筋急转弯"],[805400942,"Segment Tree","线段树"],[3008118568,"Randomized","随机化"],[135058847,"Stack","栈"],[3901555439,"Design","设计"],[1132225755,"Sliding Window","滑动窗口"],[1614322657,"Bucket Sort","桶排序"],[446798627,"Line Sweep","扫描线"],[681488273,"Bit Manipulation","位运算"],[3504911592,"Linked List","链表"],[1526846831,"Iterator","迭代器"],[4257256577,"Trie","字典树"],[4015258302,"Prefix Sum","前缀和"],[777015263,"Data Stream","数据流"],[1692555020,"Topological Sort","拓扑排序"],[3084752268,"Biconnected Component","双连通分量"],[767310859,"Interactive","交互"],[3164438233,"Suffix Array","后缀数组"],[3349326461,"Rejection Sampling","拒绝采样"],[3922821388,"Matrix","矩阵"],[4247755135,"Binary Indexed Tree","树状数组"],[3609828652,"Probability and Statistics","概率与统计"]] | ||
[[1645884698,"Rolling Hash","滚动哈希"],[608099761,"Geometry","几何"],[3122227617,"Shell",""],[4015258302,"Prefix Sum","前缀和"],[135058847,"Stack","栈"],[2300936473,"Two Pointers","双指针"],[1597208551,"Graph","图"],[3084752268,"Biconnected Component","双连通分量"],[446798627,"Line Sweep","扫描线"],[4257256577,"Trie","字典树"],[882398702,"Breadth-First Search","广度优先搜索"],[1432994735,"Math","数学"],[3152783174,"Shortest Path","最短路"],[1378748721,"Strongly Connected Component","强连通分量"],[1303275809,"Minimum Spanning Tree","最小生成树"],[2593860184,"Queue","队列"],[954837032,"Monotonic Queue","单调队列"],[20600792,"Counting Sort","计数排序"],[3008118568,"Randomized","随机化"],[2947477999,"Sorting","排序"],[868588451,"Hash Function","哈希函数"],[1808652384,"Binary Search Tree","二叉搜索树"],[805400942,"Segment Tree","线段树"],[1614322657,"Bucket Sort","桶排序"],[3381359851,"Dynamic Programming","动态规划"],[2967599592,"Binary Search","二分查找"],[4141685903,"Union Find","并查集"],[1674020409,"Memoization","记忆化搜索"],[767310859,"Interactive","交互"],[492620472,"Concurrency","多线程"],[3901555439,"Design","设计"],[3361825412,"Quickselect","快速选择"],[666045116,"Enumeration","枚举"],[3789650833,"Merge Sort","归并排序"],[3200621928,"Game Theory","博弈"],[4036243672,"Database","数据库"],[1615808600,"String","字符串"],[1631658827,"Depth-First Search","深度优先搜索"],[803820082,"Ordered Set","有序集合"],[3922821388,"Matrix","矩阵"],[2952532185,"Greedy","贪心"],[777015263,"Data Stream","数据流"],[2981007068,"Combinatorics","组合数学"],[382270662,"Array","数组"],[3504911592,"Linked List","链表"],[2720626878,"Doubly-Linked List","双向链表"],[2604685700,"Counting","计数"],[1315724598,"Simulation","模拟"],[110965111,"Brainteaser","脑筋急转弯"],[1692555020,"Topological Sort","拓扑排序"],[3349326461,"Rejection Sampling","拒绝采样"],[681488273,"Bit Manipulation","位运算"],[4116070215,"String Matching","字符串匹配"],[3988226293,"Tree","树"],[226253435,"Radix Sort","基数排序"],[3164438233,"Suffix Array","后缀数组"],[3376788625,"Eulerian Circuit","欧拉回路"],[1618992015,"Monotonic Stack","单调栈"],[1858746375,"Recursion","递归"],[4247755135,"Binary Indexed Tree","树状数组"],[851369480,"Bitmask","状态压缩"],[4013823363,"Heap (Priority Queue)","堆(优先队列)"],[1132225755,"Sliding Window","滑动窗口"],[604962628,"Binary Tree","二叉树"],[3609828652,"Probability and Statistics","概率与统计"],[1526846831,"Iterator","迭代器"],[2282267785,"Number Theory","数论"],[334724963,"Reservoir Sampling","水塘抽样"],[2777070981,"Hash Table","哈希表"],[2465402031,"Backtracking","回溯"],[2745966228,"Divide and Conquer","分治"]] |
Large diffs are not rendered by default.
Oops, something went wrong.