Merge pull request #516 from openset/develop

Add: translation

Author: Shuo

README.md

@@ -411,9 +411,9 @@ LeetCode Problems' Solutions
 | <span id="686">686</span> | [Repeated String Match](https://leetcode.com/problems/repeated-string-match "重复叠加字符串匹配") | [Go](https://github.com/openset/leetcode/tree/master/problems/repeated-string-match) | Easy |
 | <span id="685">685</span> | [Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii "冗余连接 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) | Hard |
 | <span id="684">684</span> | [Redundant Connection](https://leetcode.com/problems/redundant-connection "冗余连接") | [Go](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) | Medium |
-| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) | Hard |
+| <span id="683">683</span> | [K Empty Slots](https://leetcode.com/problems/k-empty-slots "K 个空花盆") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) | Hard |
 | <span id="682">682</span> | [Baseball Game](https://leetcode.com/problems/baseball-game "棒球比赛") | [Go](https://github.com/openset/leetcode/tree/master/problems/baseball-game) | Easy |
-| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/next-closest-time) | Medium |
+| <span id="681">681</span> | [Next Closest Time](https://leetcode.com/problems/next-closest-time "最近时刻") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/next-closest-time) | Medium |
 | <span id="680">680</span> | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii "验证回文字符串 Ⅱ") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii) | Easy |
 | <span id="679">679</span> | [24 Game](https://leetcode.com/problems/24-game "24 点游戏") | [Go](https://github.com/openset/leetcode/tree/master/problems/24-game) | Hard |
 | <span id="678">678</span> | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string "有效的括号字符串") | [Go](https://github.com/openset/leetcode/tree/master/problems/valid-parenthesis-string) | Medium |
@@ -428,7 +428,7 @@ LeetCode Problems' Solutions
 | <span id="669">669</span> | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree "修剪二叉搜索树") | [Go](https://github.com/openset/leetcode/tree/master/problems/trim-a-binary-search-tree) | Easy |
 | <span id="668">668</span> | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table "乘法表中第k小的数") | [Go](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table) | Hard |
 | <span id="667">667</span> | [Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii "优美的排列 II") | [Go](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii) | Medium |
-| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv) 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) | Medium |
+| <span id="666">666</span> | [Path Sum IV](https://leetcode.com/problems/path-sum-iv "路径和 IV") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) | Medium |
 | <span id="665">665</span> | [Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array "非递减数列") | [Go](https://github.com/openset/leetcode/tree/master/problems/non-decreasing-array) | Easy |
 | <span id="664">664</span> | [Strange Printer](https://leetcode.com/problems/strange-printer "奇怪的打印机") | [Go](https://github.com/openset/leetcode/tree/master/problems/strange-printer) | Hard |
 | <span id="663">663</span> | [Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition "均匀树划分") 🔒 | [Go](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition) | Medium |

tag/ordered-map/README.md

@@ -16,6 +16,6 @@
 | 731 | [我的日程安排表 II](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) | [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)]  | Medium |
 | 715 | [Range 模块](https://github.com/openset/leetcode/tree/master/problems/range-module) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)]  | Hard |
 | 699 | [掉落的方块](https://github.com/openset/leetcode/tree/master/problems/falling-squares) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)]  | Hard |
-| 683 | [K Empty Slots](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) 🔒 | [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)]  | Hard |
+| 683 | [K 个空花盆](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) 🔒 | [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)]  | Hard |
 | 352 | [将数据流变为多个不相交区间](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)]  | Hard |
 | 220 | [存在重复元素 III](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)]  | Medium |

tag/string/README.md

@@ -47,7 +47,7 @@
 | 709 | [转换成小写字母](https://github.com/openset/leetcode/tree/master/problems/to-lower-case) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Easy |
 | 696 | [计数二进制子串](https://github.com/openset/leetcode/tree/master/problems/count-binary-substrings) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Easy |
 | 686 | [重复叠加字符串匹配](https://github.com/openset/leetcode/tree/master/problems/repeated-string-match) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Easy |
-| 681 | [Next Closest Time](https://github.com/openset/leetcode/tree/master/problems/next-closest-time) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Medium |
+| 681 | [最近时刻](https://github.com/openset/leetcode/tree/master/problems/next-closest-time) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Medium |
 | 680 | [验证回文字符串 Ⅱ](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Easy |
 | 678 | [有效的括号字符串](https://github.com/openset/leetcode/tree/master/problems/valid-parenthesis-string) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Medium |
 | 657 | [机器人能否返回原点](https://github.com/openset/leetcode/tree/master/problems/robot-return-to-origin) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)]  | Easy |

tag/tree/README.md

@@ -43,7 +43,7 @@
 | 684 | [冗余连接](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/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)]  | Medium |
 | 671 | [二叉树中第二小的节点](https://github.com/openset/leetcode/tree/master/problems/second-minimum-node-in-a-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]  | Easy |
 | 669 | [修剪二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/trim-a-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]  | Easy |
-| 666 | [Path Sum IV](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]  | Medium |
+| 666 | [路径和 IV](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]  | Medium |
 | 663 | [均匀树划分](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]  | Medium |
 | 662 | [二叉树最大宽度](https://github.com/openset/leetcode/tree/master/problems/maximum-width-of-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]  | Medium |
 | 655 | [输出二叉树](https://github.com/openset/leetcode/tree/master/problems/print-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)]  | Medium |