diff --git a/README.md b/README.md index ddf0f8860..8fd098c0e 100644 --- a/README.md +++ b/README.md @@ -465,14 +465,14 @@ LeetCode Problems' Solutions | 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers "三个数的最大乘积") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers) | Easy | | 627 | [Swap Salary](https://leetcode.com/problems/swap-salary "交换工资") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/swap-salary) | Easy | | 626 | [Exchange Seats](https://leetcode.com/problems/exchange-seats "换座位") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/exchange-seats) | Medium | -| 625 | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) | Medium | +| 625 | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization "最小因式分解") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) | Medium | | 624 | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays) | Easy | | 623 | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree "在二叉树中增加一行") | [Go](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree) | Medium | | 622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue "设计循环队列") | [Go](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) | Medium | | 621 | [Task Scheduler](https://leetcode.com/problems/task-scheduler "任务调度器") | [Go](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) | Medium | | 620 | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies "有趣的电影") | [MySQL](https://github.com/openset/leetcode/tree/master/problems/not-boring-movies) | Easy | | 619 | [Biggest Single Number](https://leetcode.com/problems/biggest-single-number) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number) | Easy | -| 618 | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography) | Hard | +| 618 | [Students Report By Geography](https://leetcode.com/problems/students-report-by-geography "学生地理信息报告") 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography) | Hard | | 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees "合并二叉树") | [Go](https://github.com/openset/leetcode/tree/master/problems/merge-two-binary-trees) | Easy | | 616 | [Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string) | Medium | | 615 | [Average Salary: Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/average-salary-departments-vs-company) | Hard | diff --git a/readme/301-600.md b/readme/301-600.md index 85472c929..af3198813 100644 --- a/readme/301-600.md +++ b/readme/301-600.md @@ -61,19 +61,19 @@ LeetCode Problems' Solutions | 305 | [Number of Islands II](https://leetcode.com/problems/number-of-islands-ii "岛的数量 II") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii) | Hard | | 306 | [Additive Number](https://leetcode.com/problems/additive-number "累加数") | [Go](https://github.com/openset/leetcode/tree/master/problems/additive-number) | Medium | | 307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable "区域和检索 - 数组可修改") | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) | Medium | -| 308 | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) | Hard | +| 308 | [Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable "二维区域检索求和 - 可变") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) | Hard | | 309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown "最佳买卖股票时机含冷冻期") | [Go](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown) | Medium | | 310 | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees "最小高度树") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees) | Medium | -| 311 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication) | Medium | +| 311 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication "稀疏矩阵的乘法") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication) | Medium | | 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons "戳气球") | [Go](https://github.com/openset/leetcode/tree/master/problems/burst-balloons) | Hard | | 313 | [Super Ugly Number](https://leetcode.com/problems/super-ugly-number "超级丑数") | [Go](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number) | Medium | -| 314 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal) | Medium | +| 314 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal "二叉树竖直遍历") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal) | Medium | | 315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self "计算右侧小于当前元素的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | Hard | | 316 | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters "去除重复字母") | [Go](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters) | Hard | -| 317 | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) | Hard | +| 317 | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings "建筑物的最短距离") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) | Hard | | 318 | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths "最大单词长度乘积") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths) | Medium | | 319 | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher "灯泡开关") | [Go](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher) | Medium | -| 320 | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) | Medium | +| 320 | [Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation "列举缩写") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) | Medium | | 321 | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number "拼接最大数") | [Go](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number) | Hard | | 322 | [Coin Change](https://leetcode.com/problems/coin-change "零钱兑换") | [Go](https://github.com/openset/leetcode/tree/master/problems/coin-change) | Medium | | 323 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph "无向图中连通分量的数目") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) | Medium | @@ -218,13 +218,13 @@ LeetCode Problems' Solutions | 462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii "最少移动次数使数组元素相等 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii) | Medium | | 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter "岛屿的周长") | [Go](https://github.com/openset/leetcode/tree/master/problems/island-perimeter) | Easy | | 464 | [Can I Win](https://leetcode.com/problems/can-i-win "我能赢吗") | [Go](https://github.com/openset/leetcode/tree/master/problems/can-i-win) | Medium | -| 465 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-account-balancing) | Hard | +| 465 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing "最优账单平衡") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/optimal-account-balancing) | Hard | | 466 | [Count The Repetitions](https://leetcode.com/problems/count-the-repetitions "统计重复个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/count-the-repetitions) | Hard | | 467 | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string "环绕字符串中唯一的子字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/unique-substrings-in-wraparound-string) | Medium | | 468 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address "验证IP地址") | [Go](https://github.com/openset/leetcode/tree/master/problems/validate-ip-address) | Medium | -| 469 | [Convex Polygon](https://leetcode.com/problems/convex-polygon) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/convex-polygon) | Medium | +| 469 | [Convex Polygon](https://leetcode.com/problems/convex-polygon "凸多边形") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/convex-polygon) | Medium | | 470 | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7 "用 Rand7() 实现 Rand10()") | [Go](https://github.com/openset/leetcode/tree/master/problems/implement-rand10-using-rand7) | Medium | -| 471 | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) | Hard | +| 471 | [Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length "编码最短长度的字符串") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) | Hard | | 472 | [Concatenated Words](https://leetcode.com/problems/concatenated-words "连接词") | [Go](https://github.com/openset/leetcode/tree/master/problems/concatenated-words) | Hard | | 473 | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square "火柴拼正方形") | [Go](https://github.com/openset/leetcode/tree/master/problems/matchsticks-to-square) | Medium | | 474 | [Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes "一和零") | [Go](https://github.com/openset/leetcode/tree/master/problems/ones-and-zeroes) | Medium | @@ -237,13 +237,13 @@ LeetCode Problems' Solutions | 481 | [Magical String](https://leetcode.com/problems/magical-string "神奇字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/magical-string) | Medium | | 482 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting "密钥格式化") | [Go](https://github.com/openset/leetcode/tree/master/problems/license-key-formatting) | Easy | | 483 | [Smallest Good Base](https://leetcode.com/problems/smallest-good-base "最小好进制") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-good-base) | Hard | -| 484 | [Find Permutation](https://leetcode.com/problems/find-permutation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/find-permutation) | Medium | +| 484 | [Find Permutation](https://leetcode.com/problems/find-permutation "寻找排列") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/find-permutation) | Medium | | 485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones "最大连续1的个数") | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones) | Easy | | 486 | [Predict the Winner](https://leetcode.com/problems/predict-the-winner "预测赢家") | [Go](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner) | Medium | | 487 | [Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii) | Medium | | 488 | [Zuma Game](https://leetcode.com/problems/zuma-game "祖玛游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/zuma-game) | Hard | | 489 | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner) | Hard | -| 490 | [The Maze](https://leetcode.com/problems/the-maze) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze) | Medium | +| 490 | [The Maze](https://leetcode.com/problems/the-maze "迷宫") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/the-maze) | Medium | | 491 | [Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences "递增子序列") | [Go](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences) | Medium | | 492 | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle "构造矩形") | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-the-rectangle) | Easy | | 493 | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs "翻转对") | [Go](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | Hard | @@ -282,9 +282,9 @@ LeetCode Problems' Solutions | 528 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight "按权重随机选择") | [Go](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight) | Medium | | 529 | [Minesweeper](https://leetcode.com/problems/minesweeper "扫雷游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/minesweeper) | Medium | | 530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst "二叉搜索树的最小绝对差") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst) | Easy | -| 531 | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) | Medium | +| 531 | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i "孤独像素 I") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) | Medium | | 532 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array "数组中的K-diff数对") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array) | Easy | -| 533 | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) | Medium | +| 533 | [Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii "孤独像素 II") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) | Medium | | 535 | [Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl "TinyURL 的加密与解密") | [Go](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl) | Medium | | 536 | [Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string) | Medium | | 537 | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication "复数乘法") | [Go](https://github.com/openset/leetcode/tree/master/problems/complex-number-multiplication) | Medium | @@ -317,18 +317,18 @@ LeetCode Problems' Solutions | 565 | [Array Nesting](https://leetcode.com/problems/array-nesting "数组嵌套") | [Go](https://github.com/openset/leetcode/tree/master/problems/array-nesting) | Medium | | 566 | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix "重塑矩阵") | [Go](https://github.com/openset/leetcode/tree/master/problems/reshape-the-matrix) | Easy | | 567 | [Permutation in String](https://leetcode.com/problems/permutation-in-string "字符串的排列") | [Go](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string) | Medium | -| 568 | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days) | Hard | -| 569 | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary) | Hard | -| 570 | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/managers-with-at-least-5-direct-reports) | Medium | -| 571 | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/find-median-given-frequency-of-numbers) | Hard | +| 568 | [Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days "最大休假天数") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days) | Hard | +| 569 | [Median Employee Salary](https://leetcode.com/problems/median-employee-salary "员工薪水中位数") 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary) | Hard | +| 570 | [Managers with at Least 5 Direct Reports](https://leetcode.com/problems/managers-with-at-least-5-direct-reports "至少有5名直接下属的经理") 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/managers-with-at-least-5-direct-reports) | Medium | +| 571 | [Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers "给定数字的频率查询中位数") 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/find-median-given-frequency-of-numbers) | Hard | | 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree "另一个树的子树") | [Go](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree) | Easy | -| 573 | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation) | Medium | +| 573 | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation "松鼠模拟") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation) | Medium | | 574 | [Winning Candidate](https://leetcode.com/problems/winning-candidate "当选者") 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/winning-candidate) | Medium | | 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies "分糖果") | [Go](https://github.com/openset/leetcode/tree/master/problems/distribute-candies) | Easy | | 576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths "出界的路径数") | [Go](https://github.com/openset/leetcode/tree/master/problems/out-of-boundary-paths) | Medium | | 577 | [Employee Bonus](https://leetcode.com/problems/employee-bonus "员工奖金") 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/employee-bonus) | Easy | -| 578 | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/get-highest-answer-rate-question) | Medium | -| 579 | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/find-cumulative-salary-of-an-employee) | Hard | +| 578 | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question "查询回答率最高的问题") 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/get-highest-answer-rate-question) | Medium | +| 579 | [Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee "查询员工的累计薪水") 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/find-cumulative-salary-of-an-employee) | Hard | | 580 | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/count-student-number-in-departments) | Medium | | 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray "最短无序连续子数组") | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-unsorted-continuous-subarray) | Easy | | 582 | [Kill Process](https://leetcode.com/problems/kill-process) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/kill-process) | Medium |