Add: translation

Author: openset

tag/array/README.md

@@ -90,9 +90,9 @@
 | 561 | [数组拆分 I](https://github.com/openset/leetcode/tree/master/problems/array-partition-i) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Easy |
 | 560 | [和为K的子数组](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)]  | Medium |
 | 548 | [将数组分割成和相等的子数组](https://github.com/openset/leetcode/tree/master/problems/split-array-with-equal-sum) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Medium |
-| 533 | [Lonely Pixel II](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) 🔒 | [[深度优先搜索](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 |
+| 533 | [孤独像素 II](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) 🔒 | [[深度优先搜索](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 |
 | 532 | [数组中的K-diff数对](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)]  | Easy |
-| 531 | [Lonely Pixel I](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) 🔒 | [[深度优先搜索](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 |
+| 531 | [孤独像素 I](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) 🔒 | [[深度优先搜索](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 |
 | 509 | [斐波那契数](https://github.com/openset/leetcode/tree/master/problems/fibonacci-number) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Easy |
 | 495 | [提莫攻击](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Medium |
 | 485 | [最大连续1的个数](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)]  | Easy |

tag/backtracking/README.md

@@ -20,7 +20,7 @@
 | 401 | [二进制手表](https://github.com/openset/leetcode/tree/master/problems/binary-watch) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]  | Easy |
 | 357 | [计算各个位数不同的数字个数](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]  | Medium |
 | 351 | [安卓系统手势解锁](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]  | Medium |
-| 320 | [Generalized Abbreviation](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]  | Medium |
+| 320 | [列举缩写](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]  | Medium |
 | 306 | [累加数](https://github.com/openset/leetcode/tree/master/problems/additive-number) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]  | Medium |
 | 294 | [翻转游戏 II](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) 🔒 | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]  | Medium |
 | 291 | [单词模式 II](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii) 🔒 | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]  | Hard |

tag/binary-indexed-tree/README.md

@@ -12,6 +12,6 @@
 | 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 |
 | 327 | [区间和的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | [[排序](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 |
 | 315 | [计算右侧小于当前元素的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | [[排序](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 |
-| 308 | [Range Sum Query 2D - Mutable](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) 🔒 | [[树状数组](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)]  | Hard |
+| 308 | [二维区域检索求和 - 可变](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) 🔒 | [[树状数组](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)]  | Hard |
 | 307 | [区域和检索 - 数组可修改](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) | [[树状数组](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)]  | Medium |
 | 218 | [天际线问题](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/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/divide-and-conquer/README.md)]  | Hard |

tag/bit-manipulation/README.md

@@ -28,7 +28,7 @@
 | 371 | [两整数之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]  | Easy |
 | 342 | [4的幂](https://github.com/openset/leetcode/tree/master/problems/power-of-four) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]  | Easy |
 | 338 | [比特位计数](https://github.com/openset/leetcode/tree/master/problems/counting-bits) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)]  | Medium |
-| 320 | [Generalized Abbreviation](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]  | Medium |
+| 320 | [列举缩写](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)]  | Medium |
 | 318 | [最大单词长度乘积](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]  | Medium |
 | 268 | [缺失数字](https://github.com/openset/leetcode/tree/master/problems/missing-number) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)]  | Easy |
 | 260 | [只出现一次的数字 III](https://github.com/openset/leetcode/tree/master/problems/single-number-iii) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)]  | Medium |

tag/breadth-first-search/README.md

@@ -34,12 +34,12 @@
 | 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 |
-| 490 | [The Maze](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 |
+| 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 |
 | 407 | [接雨水 II](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Hard |
 | 323 | [无向图中连通分量的数目](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) 🔒 | [[深度优先搜索](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/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)]  | Medium |
-| 317 | [Shortest Distance from All Buildings](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) 🔒 | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Hard |
+| 317 | [建筑物的最短距离](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) 🔒 | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Hard |
 | 310 | [最小高度树](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)]  | Medium |
 | 301 | [删除无效的括号](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses) | [[深度优先搜索](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 |
 | 286 | [墙与门](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) 🔒 | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)]  | Medium |