|
9 | 9 |
|
10 | 10 | | # | 题名 | 标签 | 难度 | |
11 | 11 | | :-: | - | - | :-: | |
| 12 | +| 983 | [最低票价](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-for-tickets) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | |
| 13 | +| 982 | [按位与为零的三元组](https://github.com/openset/leetcode/tree/master/problems/triples-with-bitwise-and-equal-to-zero) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | |
| 14 | +| 980 | [不同路径 III](https://github.com/openset/leetcode/tree/master/problems/unique-paths-iii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | |
12 | 15 | | 975 | [奇偶跳](https://github.com/openset/leetcode/tree/master/problems/odd-even-jump) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | |
13 | 16 | | 968 | [监控二叉树](https://github.com/openset/leetcode/tree/master/problems/binary-tree-cameras) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | |
14 | 17 | | 967 | [连续差相同的数字](https://github.com/openset/leetcode/tree/master/problems/numbers-with-same-consecutive-differences) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | |
|
0 commit comments