We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
递归/栈
广度优先搜索 BFS
队列
贪心算法
当前状态的最优
动态规划
对比贪心算法:可回溯
二分查找
1.单调性 2.上下界 3.可索引