Merge pull request #509 from openset/develop

Add: translation

Author: Shuo

readme/301-600.md

@@ -32,8 +32,8 @@
 | 529 | [扫雷游戏](https://github.com/openset/leetcode/tree/master/problems/minesweeper) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Medium |
 | 515 | [在每个树行中找最大值](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row) | [[树](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/breadth-first-search/README.md)]  | Medium |
 | 513 | [找树左下角的值](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value) | [[树](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/breadth-first-search/README.md)]  | Medium |
-| 505 | [The Maze II](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Medium |
-| 499 | [The Maze III](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Hard |
+| 505 | [迷宫 II](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Medium |
+| 499 | [迷宫 III](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Hard |
 | 490 | [迷宫](https://github.com/openset/leetcode/tree/master/problems/the-maze) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Medium |
 | 429 | [N叉树的层序遍历](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Easy |
 | 417 | [太平洋大西洋水流问题](https://github.com/openset/leetcode/tree/master/problems/pacific-atlantic-water-flow) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Medium |

tag/breadth-first-search/README.md

@@ -61,12 +61,12 @@
 | 515 | [在每个树行中找最大值](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row) | [[树](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/breadth-first-search/README.md)]  | Medium |
 | 514 | [自由之路](https://github.com/openset/leetcode/tree/master/problems/freedom-trail) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Hard |
 | 513 | [找树左下角的值](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value) | [[树](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/breadth-first-search/README.md)]  | Medium |
-| 505 | [The Maze II](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Medium |
-| 499 | [The Maze III](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Hard |
+| 505 | [迷宫 II](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Medium |
+| 499 | [迷宫 III](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Hard |
 | 494 | [目标和](https://github.com/openset/leetcode/tree/master/problems/target-sum) | [[深度优先搜索](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)]  | Medium |
 | 491 | [递增子序列](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]  | Medium |
 | 490 | [迷宫](https://github.com/openset/leetcode/tree/master/problems/the-maze) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Medium |
-| 489 | [Robot Room Cleaner](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]  | Hard |
+| 489 | [扫地机器人](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]  | Hard |
 | 488 | [祖玛游戏](https://github.com/openset/leetcode/tree/master/problems/zuma-game) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]  | Hard |
 | 473 | [火柴拼正方形](https://github.com/openset/leetcode/tree/master/problems/matchsticks-to-square) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]  | Medium |
 | 472 | [连接词](https://github.com/openset/leetcode/tree/master/problems/concatenated-words) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Hard |

tag/depth-first-search/README.md

@@ -19,7 +19,7 @@
 | 631 | [Design Excel Sum Formula](https://github.com/openset/leetcode/tree/master/problems/design-excel-sum-formula) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)]  | Hard |
 | 622 | [设计循环队列](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)]  | Medium |
 | 604 | [Design Compressed String Iterator](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)]  | Easy |
-| 588 | [Design In-Memory File System](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)]  | Hard |
+| 588 | [设计内存文件系统](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)]  | Hard |
 | 460 | [LFU缓存](https://github.com/openset/leetcode/tree/master/problems/lfu-cache) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)]  | Hard |
 | 432 | [全 O(1) 的数据结构](https://github.com/openset/leetcode/tree/master/problems/all-oone-data-structure) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)]  | Hard |
 | 381 | [O(1) 时间插入、删除和获取随机元素 - 允许重复](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]  | Hard |

tag/design/README.md

@@ -64,7 +64,7 @@
 | 651 | [4 Keys Keyboard](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Medium |
 | 645 | [错误的集合](https://github.com/openset/leetcode/tree/master/problems/set-mismatch) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Easy |
 | 640 | [求解方程](https://github.com/openset/leetcode/tree/master/problems/solve-the-equation) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Medium |
-| 634 | [Find the Derangement of An Array](https://github.com/openset/leetcode/tree/master/problems/find-the-derangement-of-an-array) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Medium |
+| 634 | [寻找数组的错位排列](https://github.com/openset/leetcode/tree/master/problems/find-the-derangement-of-an-array) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Medium |
 | 633 | [平方数之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-square-numbers) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Easy |
 | 628 | [三个数的最大乘积](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Easy |
 | 625 | [最小因式分解](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Medium |

tag/math/README.md

@@ -14,7 +14,7 @@
 | 641 | [设计循环双端队列](https://github.com/openset/leetcode/tree/master/problems/design-circular-deque) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)]  | Medium |
 | 622 | [设计循环队列](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)]  | Medium |
 | 621 | [任务调度器](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Medium |
-| 582 | [Kill Process](https://github.com/openset/leetcode/tree/master/problems/kill-process) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)]  | Medium |
+| 582 | [杀死进程](https://github.com/openset/leetcode/tree/master/problems/kill-process) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)]  | Medium |
 | 363 | [矩形区域不超过 K 的最大数值和](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k) | [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Hard |
 | 353 | [贪吃蛇判定器](https://github.com/openset/leetcode/tree/master/problems/design-snake-game) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)]  | Medium |
 | 346 | [数据流中的移动平均值](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)]  | Easy |

tag/queue/README.md

@@ -20,6 +20,6 @@
 | 698 | [划分为k个相等的子集](https://github.com/openset/leetcode/tree/master/problems/partition-to-k-equal-sum-subsets) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Medium |
 | 687 | [最长同值路径](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)]  | Easy |
 | 625 | [最小因式分解](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Medium |
-| 544 | [Output Contest Matches](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Medium |
+| 544 | [输出比赛匹配对](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Medium |
 | 248 | [中心对称数 III](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Hard |
 | 247 | [中心对称数 II](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Medium |

tag/recursion/README.md

@@ -16,7 +16,7 @@
 | 922 | [按奇偶排序数组 II](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity-ii) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Easy |
 | 767 | [重构字符串](https://github.com/openset/leetcode/tree/master/problems/reorganize-string) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Medium |
 | 710 | [黑名单中的随机数](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)]  | Hard |
-| 527 | [Word Abbreviation](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Hard |
+| 527 | [单词缩写](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Hard |
 | 524 | [通过删除字母匹配到字典里最长单词](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)]  | Medium |
 | 493 | [翻转对](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)]  | Hard |
 | 350 | [两个数组的交集 II](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Easy |