Merge pull request #520 from openset/develop

Add: translation

Author: Shuo

README.md

@@ -298,7 +298,7 @@ LeetCode Problems' Solutions
 | <span id="803">803</span> | [Bricks Falling When Hit](https://leetcode.com/problems/bricks-falling-when-hit "打砖块") | [Go](https://github.com/openset/leetcode/tree/master/problems/bricks-falling-when-hit) | Hard |
 | <span id="802">802</span> | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states "找到最终的安全状态") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-eventual-safe-states) | Medium |
 | <span id="801">801</span> | [Minimum Swaps To Make Sequences Increasing](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing "使序列递增的最小交换次数") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-sequences-increasing) | Medium |
-| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) | Easy |
+| <span id="800">800</span> | [Similar RGB Color](https://leetcode.com/problems/similar-rgb-color "相似的 RGB 颜色") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) | Easy |
 | <span id="799">799</span> | [Champagne Tower](https://leetcode.com/problems/champagne-tower "香槟塔") | [Go](https://github.com/openset/leetcode/tree/master/problems/champagne-tower) | Medium |
 | <span id="798">798</span> | [Smallest Rotation with Highest Score](https://leetcode.com/problems/smallest-rotation-with-highest-score "得分最高的最小轮调") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-rotation-with-highest-score) | Hard |
 | <span id="797">797</span> | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target "所有可能的路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-to-target) | Medium |
@@ -322,9 +322,9 @@ LeetCode Problems' Solutions
 | <span id="779">779</span> | [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar "第K个语法符号") | [Go](https://github.com/openset/leetcode/tree/master/problems/k-th-symbol-in-grammar) | Medium |
 | <span id="778">778</span> | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water "水位上升的泳池中游泳") | [Go](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water) | Hard |
 | <span id="777">777</span> | [Swap Adjacent in LR String](https://leetcode.com/problems/swap-adjacent-in-lr-string "在LR字符串中交换相邻字符") | [Go](https://github.com/openset/leetcode/tree/master/problems/swap-adjacent-in-lr-string) | Medium |
-| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/split-bst) | Medium |
+| <span id="776">776</span> | [Split BST](https://leetcode.com/problems/split-bst "拆分二叉搜索树") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/split-bst) | Medium |
 | <span id="775">775</span> | [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions "全局倒置与局部倒置") | [Go](https://github.com/openset/leetcode/tree/master/problems/global-and-local-inversions) | Medium |
-| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) | Hard |
+| <span id="774">774</span> | [Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station "最小化加油站的最大距离") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) | Hard |
 | <span id="773">773</span> | [Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle "滑动谜题") | [Go](https://github.com/openset/leetcode/tree/master/problems/sliding-puzzle) | Hard |
 | <span id="772">772</span> | [Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii "基本计算器 III") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) | Hard |
 | <span id="771">771</span> | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones "宝石与石头") | [Go](https://github.com/openset/leetcode/tree/master/problems/jewels-and-stones) | Easy |

tag/binary-search/README.md

@@ -21,7 +21,7 @@
 | 793 | [阶乘函数后K个零](https://github.com/openset/leetcode/tree/master/problems/preimage-size-of-factorial-zeroes-function) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Hard |
 | 786 | [第 K 个最小的素数分数](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Hard |
 | 778 | [水位上升的泳池中游泳](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/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/binary-search/README.md)]  | Hard |
-| 774 | [Minimize Max Distance to Gas Station](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) 🔒 | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Hard |
+| 774 | [最小化加油站的最大距离](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) 🔒 | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Hard |
 | 744 | [寻找比目标字母大的最小字母](https://github.com/openset/leetcode/tree/master/problems/find-smallest-letter-greater-than-target) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Easy |
 | 719 | [找出第 k 小的距离对](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)]  | Hard |
 | 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 |

tag/math/README.md

@@ -49,7 +49,7 @@
 | 812 | [最大三角形面积](https://github.com/openset/leetcode/tree/master/problems/largest-triangle-area) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Easy |
 | 810 | [黑板异或游戏](https://github.com/openset/leetcode/tree/master/problems/chalkboard-xor-game) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Hard |
 | 805 | [数组的均值分割](https://github.com/openset/leetcode/tree/master/problems/split-array-with-same-average) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Hard |
-| 800 | [Similar RGB Color](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Easy |
+| 800 | [相似的 RGB 颜色](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Easy |
 | 794 | [有效的井字游戏](https://github.com/openset/leetcode/tree/master/problems/valid-tic-tac-toe-state) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Medium |
 | 789 | [逃脱阻碍者](https://github.com/openset/leetcode/tree/master/problems/escape-the-ghosts) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Medium |
 | 782 | [变为棋盘](https://github.com/openset/leetcode/tree/master/problems/transform-to-chessboard) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Hard |

tag/recursion/README.md

@@ -14,7 +14,7 @@
 | 794 | [有效的井字游戏](https://github.com/openset/leetcode/tree/master/problems/valid-tic-tac-toe-state) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Medium |
 | 783 | [二叉搜索树结点最小距离](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)]  | Easy |
 | 779 | [第K个语法符号](https://github.com/openset/leetcode/tree/master/problems/k-th-symbol-in-grammar) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)]  | Medium |
-| 776 | [Split BST](https://github.com/openset/leetcode/tree/master/problems/split-bst) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)]  | Medium |
+| 776 | [拆分二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/split-bst) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)]  | Medium |
 | 761 | [特殊的二进制序列](https://github.com/openset/leetcode/tree/master/problems/special-binary-string) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Hard |
 | 726 | [原子的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]  | Hard |
 | 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 |

tag/string/README.md

@@ -33,7 +33,7 @@
 | 816 | [模糊坐标](https://github.com/openset/leetcode/tree/master/problems/ambiguous-coordinates) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Medium |
 | 809 | [情感丰富的文字](https://github.com/openset/leetcode/tree/master/problems/expressive-words) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Medium |
 | 804 | [唯一摩尔斯密码词](https://github.com/openset/leetcode/tree/master/problems/unique-morse-code-words) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Easy |
-| 800 | [Similar RGB Color](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Easy |
+| 800 | [相似的 RGB 颜色](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Easy |
 | 791 | [自定义字符串排序](https://github.com/openset/leetcode/tree/master/problems/custom-sort-string) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Medium |
 | 788 | [旋转数字](https://github.com/openset/leetcode/tree/master/problems/rotated-digits) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Easy |
 | 772 | [基本计算器 III](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) 🔒 | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Hard |

tag/tree/README.md

@@ -34,7 +34,7 @@
 | 834 | [树中距离之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-distances-in-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)]  | Hard |
 | 814 | [二叉树剪枝](https://github.com/openset/leetcode/tree/master/problems/binary-tree-pruning) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]  | Medium |
 | 783 | [二叉搜索树结点最小距离](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)]  | Easy |
-| 776 | [Split BST](https://github.com/openset/leetcode/tree/master/problems/split-bst) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)]  | Medium |
+| 776 | [拆分二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/split-bst) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)]  | Medium |
 | 742 | [二叉树最近的叶节点](https://github.com/openset/leetcode/tree/master/problems/closest-leaf-in-a-binary-tree) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]  | Medium |
 | 701 | [二叉搜索树中的插入操作](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]  | Medium |
 | 700 | [二叉搜索树中的搜索](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]  | Easy |