Add: translation

Author: openset

tag/array/README.md

@@ -58,7 +58,7 @@
 | 769 | [最多能完成排序的块](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Medium |
 | 768 | [最多能完成排序的块 II](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Hard |
 | 766 | [托普利茨矩阵](https://github.com/openset/leetcode/tree/master/problems/toeplitz-matrix) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Easy |
-| 755 | [Pour Water](https://github.com/openset/leetcode/tree/master/problems/pour-water) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Medium |
+| 755 | [倒水](https://github.com/openset/leetcode/tree/master/problems/pour-water) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Medium |
 | 747 | [至少是其他数字两倍的最大数](https://github.com/openset/leetcode/tree/master/problems/largest-number-at-least-twice-of-others) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Easy |
 | 746 | [使用最小花费爬楼梯](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Easy |
 | 729 | [我的日程安排表 I](https://github.com/openset/leetcode/tree/master/problems/my-calendar-i) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Medium |

tag/binary-search/README.md

@@ -27,7 +27,7 @@
 | 718 | [最长重复子数组](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/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)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/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 |
 | 704 | [二分查找](https://github.com/openset/leetcode/tree/master/problems/binary-search) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Easy |
-| 702 | [Search in a Sorted Array of Unknown Size](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size) 🔒 | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Medium |
+| 702 | [搜索长度未知的有序数组](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size) 🔒 | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Medium |
 | 668 | [乘法表中第k小的数](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Hard |
 | 658 | [找到 K 个最接近的元素](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Medium |
 | 644 | [最大平均子段和 II](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Hard |

tag/bit-manipulation/README.md

@@ -13,7 +13,7 @@
 | 784 | [字母大小写全排列](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]  | Easy |
 | 762 | [二进制表示中质数个计算置位](https://github.com/openset/leetcode/tree/master/problems/prime-number-of-set-bits-in-binary-representation) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]  | Easy |
 | 756 | [金字塔转换矩阵](https://github.com/openset/leetcode/tree/master/problems/pyramid-transition-matrix) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]  | Medium |
-| 751 | [IP to CIDR](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]  | Easy |
+| 751 | [IP 到 CIDR](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]  | Easy |
 | 693 | [交替位二进制数](https://github.com/openset/leetcode/tree/master/problems/binary-number-with-alternating-bits) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]  | Easy |
 | 477 | [汉明距离总和](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]  | Medium |
 | 476 | [数字的补数](https://github.com/openset/leetcode/tree/master/problems/number-complement) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]  | Easy |

tag/depth-first-search/README.md

@@ -42,9 +42,9 @@
 | 737 | [句子相似性 II](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)]  | Medium |
 | 733 | [图像渲染](https://github.com/openset/leetcode/tree/master/problems/flood-fill) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]  | Easy |
 | 721 | [账户合并](https://github.com/openset/leetcode/tree/master/problems/accounts-merge) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)]  | Medium |
-| 711 | [Number of Distinct Islands II](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]  | Hard |
+| 711 | [不同岛屿的数量 II](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]  | Hard |
 | 695 | [岛屿的最大面积](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Medium |
-| 694 | [Number of Distinct Islands](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]  | Medium |
+| 694 | [不同岛屿的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]  | Medium |
 | 690 | [员工的重要性](https://github.com/openset/leetcode/tree/master/problems/employee-importance) | [[深度优先搜索](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)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]  | Easy |
 | 685 | [冗余连接 II](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) | [[树](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/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)]  | Hard |
 | 679 | [24 点游戏](https://github.com/openset/leetcode/tree/master/problems/24-game) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]  | Hard |

tag/design/README.md

@@ -13,10 +13,10 @@
 | 707 | [设计链表](https://github.com/openset/leetcode/tree/master/problems/design-linked-list) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)]  | Easy |
 | 706 | [设计哈希映射](https://github.com/openset/leetcode/tree/master/problems/design-hashmap) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]  | Easy |
 | 705 | [设计哈希集合](https://github.com/openset/leetcode/tree/master/problems/design-hashset) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]  | Easy |
-| 642 | [Design Search Autocomplete System](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)]  | Hard |
+| 642 | [设计搜索自动补全系统](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)]  | Hard |
 | 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 |
-| 635 | [Design Log Storage System](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Medium |
-| 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 |
+| 635 | [设计日志存储系统](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Medium |
+| 631 | [设计 Excel 求和公式](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 | [迭代压缩字符串](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 | [设计内存文件系统](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 |

tag/dynamic-programming/README.md

@@ -47,7 +47,7 @@
 | 790 | [多米诺和托米诺平铺](https://github.com/openset/leetcode/tree/master/problems/domino-and-tromino-tiling) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Medium |
 | 787 | [K 站中转内最便宜的航班](https://github.com/openset/leetcode/tree/master/problems/cheapest-flights-within-k-stops) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Medium |
 | 764 | [最大加号标志](https://github.com/openset/leetcode/tree/master/problems/largest-plus-sign) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Medium |
-| 750 | [Number Of Corner Rectangles](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Medium |
+| 750 | [角矩形的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Medium |
 | 746 | [使用最小花费爬楼梯](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Easy |
 | 741 | [摘樱桃](https://github.com/openset/leetcode/tree/master/problems/cherry-pickup) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Hard |
 | 740 | [删除与获得点数](https://github.com/openset/leetcode/tree/master/problems/delete-and-earn) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Medium |

tag/greedy/README.md

@@ -31,7 +31,7 @@
 | 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 |
 | 765 | [情侣牵手](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)]  | Hard |
 | 763 | [划分字母区间](https://github.com/openset/leetcode/tree/master/problems/partition-labels) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)]  | Medium |
-| 759 | [Employee Free Time](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) 🔒 | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)]  | Hard |
+| 759 | [员工空闲时间](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) 🔒 | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)]  | Hard |
 | 757 | [ 设置交集大小至少为2](https://github.com/openset/leetcode/tree/master/problems/set-intersection-size-at-least-two) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)]  | Hard |
 | 738 | [单调递增的数字](https://github.com/openset/leetcode/tree/master/problems/monotone-increasing-digits) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)]  | Medium |
 | 714 | [买卖股票的最佳时机含手续费](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Medium |