Skip to content
Eve
Greedy
Initializing search
Everoot
Home
Algorithms
Architecture
Database
OS
Network
Tools
Projects
Blog
Eve
Everoot
Home
Algorithms
Algorithms
Data Structures
Data Structures
Array
Disjoint Sets
String
Trie
Leetcode
Leetcode
LeetCode Tags
Problem List
Algorithms
Algorithms
Code templates
Divide & Conquer
Index
The Knuth-Morris-Pratt algorithm
Memoization
MergeSort
Binary Search
Bit Manipulation
Dynamic Programming
Graph
Greedy
Greedy
Greedy
Linked List
Monotonic Stack
Sliding Window
Quantum
Quantum
Grover
QKD
Architecture
Database
OS
Network
Tools
Projects
Blog
Greedy
核心: 每一步做出的都是当前看起来最好的选择, 只是局部的最优选择, 而不是整体的最优选择.
难点: 最优解很难get, 结合其他算法
322
1217
55
135. Candy
Back to top