Home
Sean's CheatSheet
Summary
1.1.
Introduction
1.2.
Basics
Physical Data Structures
2.1.
Array
2.2.
Sorting Algorithms
2.3.
Binary Search
2.4.
Two Pointers
2.5.
String
2.6.
Linked List
Logical Data Structures
3.1.
Binary Tree
3.2.
Graph
3.3.
Queue & Stack
3.4.
Heap
3.5.
Hash Table
3.6.
Trie Tree
3.7.
Segment Tree
Other problems
4.1.
Dynamic Programming
4.2.
Big Data Situation
4.3.
Bit
4.4.
Probility, Sampling, Randomization
4.5.
Combination of Data Structures
4.6.
Classic Problems with Multiple Solutions
4.7.
Other Algorithms
Java
5.1.
Basics
5.2.
Collections
5.3.
Map
5.4.
String
5.5.
JVM
5.6.
Exceptions
5.7.
File
5.8.
JUnit Test
OOD
6.1.
OOD
6.2.
Design Pattern
Operating Systems
7.1.
Concurrency
Other Languages
8.1.
Python
8.1.1.
Data Structure
8.1.2.
异步
8.2.
C++
Powered by
GitBook
Other Algorithms
Other algorithms
Voting algorithms
加强6 Q4
黑帮火拼算法 数第二遍
优势：牺牲时间常数项，减少空间复杂度
证明：
活下来的人一定是出现次数大于1/K的元素（活下来是必要条件） 数第二遍（证明充分条件）
results matching "
"
No results matching "
"