O1
Greedy Algorithm
贪心算法
Optimization / 最值Grades G5 - G8
👀
What It Looks Like
Recognition signals — when you see these, think of this structure:
- 1Optimization problems where local choices seem to work
- 2Scheduling or selection problems
- 3Questions asking for maximum or minimum
🎯
What It Really Tests
The core mathematical idea behind this structure:
Make the locally optimal choice at each step, hoping to find the global optimum.
在每一步做出局部最优选择，希望找到全局最优。
⚠️
Why Students Get Stuck
Common mistakes to watch out for:
- ⚠Assuming greedy always works (it doesn't for all problems)
- ⚠Not verifying the greedy choice is actually optimal
- ⚠Missing cases where look-ahead is needed
💡
Your First Step
How to begin thinking about problems with this structure:
At each decision point, pick the option that looks best right now.
在每个决策点，选择当前看起来最好的选项。
Related Structures
These structures share similar patterns or thinking approaches: