@@ -347,7 +347,7 @@ title: "面试进阶 300 题"
347
347
| 0152 | [ 乘积最大子数组] ( https://leetcode.com/problems/maximum-product-subarray/ ) | [ JS] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0152 ) | [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 动态规划 ` ] ( /leetcode/outline/tag/dynamic-programming.md ) | <font color =#ffb800 >Medium</font > |
348
348
| 0338 | [ 比特位计数] ( https://leetcode.com/problems/counting-bits/ ) | | [ ` 位运算 ` ] ( /leetcode/outline/tag/bit-manipulation.md ) [ ` 动态规划 ` ] ( /leetcode/outline/tag/dynamic-programming.md ) | <font color =#15bd66 >Esay</font > |
349
349
| 0309 | [ 最佳买卖股票时机含冷冻期] ( https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/ ) | [ JS] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0309 ) | [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 动态规划 ` ] ( /leetcode/outline/tag/dynamic-programming.md ) | <font color =#ffb800 >Medium</font > |
350
- | 0264 | [ 丑数 II] ( https://leetcode.com/problems/ugly-number-ii/ ) | | [ ` 哈希表 ` ] ( /leetcode/outline/tag/hash-table.md ) [ ` 数学 ` ] ( /leetcode/outline/tag/mathematics.md ) [ ` 动态规划 ` ] ( /leetcode/outline/tag/dynamic-programming.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
350
+ | 0264 | [ 丑数 II] ( https://leetcode.com/problems/ugly-number-ii/ ) | [ JS ] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0264 ) | [ ` 哈希表 ` ] ( /leetcode/outline/tag/hash-table.md ) [ ` 数学 ` ] ( /leetcode/outline/tag/mathematics.md ) [ ` 动态规划 ` ] ( /leetcode/outline/tag/dynamic-programming.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
351
351
| 0279 | [ 完全平方数] ( https://leetcode.com/problems/perfect-squares/ ) | [ JS] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0279 ) | [ ` 广度优先搜索 ` ] ( /leetcode/outline/tag/breadth-first-search.md ) [ ` 数学 ` ] ( /leetcode/outline/tag/mathematics.md ) [ ` 动态规划 ` ] ( /leetcode/outline/tag/dynamic-programming.md ) | <font color =#ffb800 >Medium</font > |
352
352
| 0032 | [ 最长有效括号] ( https://leetcode.com/problems/longest-valid-parentheses/ ) | | [ ` 栈 ` ] ( /leetcode/outline/tag/stack.md ) [ ` 字符串 ` ] ( /leetcode/outline/tag/string.md ) [ ` 动态规划 ` ] ( /leetcode/outline/tag/dynamic-programming.md ) | <font color =#ff334b >Hard</font > |
353
353
| 0354 | [ 俄罗斯套娃信封问题] ( https://leetcode.com/problems/russian-doll-envelopes/ ) | [ JS] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0354 ) | [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 二分查找 ` ] ( /leetcode/outline/tag/binary-search.md ) [ ` 动态规划 ` ] ( /leetcode/outline/tag/dynamic-programming.md ) ` 1+ ` | <font color =#ff334b >Hard</font > |
@@ -471,7 +471,7 @@ title: "面试进阶 300 题"
471
471
472
472
| 题号 | 标题 | 题解 | 标签 | 难度 |
473
473
| :------: | :------ | :------: | :------ | :------ |
474
- | 0264 | [ 丑数 II] ( https://leetcode.com/problems/ugly-number-ii/ ) | | [ ` 哈希表 ` ] ( /leetcode/outline/tag/hash-table.md ) [ ` 数学 ` ] ( /leetcode/outline/tag/mathematics.md ) [ ` 动态规划 ` ] ( /leetcode/outline/tag/dynamic-programming.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
474
+ | 0264 | [ 丑数 II] ( https://leetcode.com/problems/ugly-number-ii/ ) | [ JS ] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0264 ) | [ ` 哈希表 ` ] ( /leetcode/outline/tag/hash-table.md ) [ ` 数学 ` ] ( /leetcode/outline/tag/mathematics.md ) [ ` 动态规划 ` ] ( /leetcode/outline/tag/dynamic-programming.md ) ` 1+ ` | <font color =#ffb800 >Medium</font > |
475
475
| 0946 | [ 验证栈序列] ( https://leetcode.com/problems/validate-stack-sequences/ ) | [ JS] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0946 ) | [ ` 栈 ` ] ( /leetcode/outline/tag/stack.md ) [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 模拟 ` ] ( /leetcode/outline/tag/simulation.md ) | <font color =#ffb800 >Medium</font > |
476
476
| 0767 | [ 重构字符串] ( https://leetcode.com/problems/reorganize-string/ ) | | [ ` 贪心 ` ] ( /leetcode/outline/tag/greedy.md ) [ ` 哈希表 ` ] ( /leetcode/outline/tag/hash-table.md ) [ ` 字符串 ` ] ( /leetcode/outline/tag/string.md ) ` 3+ ` | <font color =#ffb800 >Medium</font > |
477
477
| 0373 | [ 查找和最小的 K 对数字] ( https://leetcode.com/problems/find-k-pairs-with-smallest-sums/ ) | [ JS] ( https://2xiao.github.io/leetcode-js/leetcode/problem/0373 ) | [ ` 数组 ` ] ( /leetcode/outline/tag/array.md ) [ ` 堆(优先队列) ` ] ( /leetcode/outline/tag/heap-priority-queue.md ) | <font color =#ffb800 >Medium</font > |
0 commit comments