diff --git a/index.html b/index.html
index fa5eedea07..6c38a10c59 100644
--- a/index.html
+++ b/index.html
@@ -24,6 +24,11 @@
 <body>
   <div id="app">LeetCode & Coding Interview Guide @Doocs</div>
   <script>
+    const isEn = () => location.hash.includes('README_EN');
+    window.addEventListener('hashchange', () => {
+      window.$docsify.loadSidebar = isEn() ?  'summary_en.md' : 'summary.md'
+    });
+
     window.$docsify = {
       name: 'leetcode',
       repo: 'doocs/leetcode',
@@ -31,7 +36,7 @@
       search: [
         '/', '/solution/', '/lcof/', '/lcof2/', '/lcci/', '/lcs/', '/lcp/', '/basic/'
       ],
-      loadSidebar: 'summary.md',
+      loadSidebar: isEn() ?  'summary_en.md' : 'summary.md',
       auto2top: true,
       subMaxLevel: 2,
       alias: {
@@ -41,7 +46,15 @@
         '/lcof/.*/summary.md': '/lcof/summary.md',
         '/lcof2/.*/summary.md': '/lcof2/summary.md',
         '/solution/.*/summary.md': '/solution/summary.md',
-        '/basic/.*/summary.md': '/basic/summary.md'
+        '/basic/.*/summary.md': '/basic/summary.md',
+
+        '/lcs/.*/summary_en.md': '/lcs/summary_en.md',
+        '/lcp/.*/summary_en.md': '/lcp/summary_en.md',
+        '/lcci/.*/summary_en.md': '/lcci/summary_en.md',
+        '/lcof/.*/summary_en.md': '/lcof/summary_en.md',
+        '/lcof2/.*/summary_en.md': '/lcof2/summary_en.md',
+        '/solution/.*/summary_en.md': '/solution/summary_en.md',
+        '/basic/.*/summary_en.md': '/basic/summary_en.md',
       },
       contributors: {
         repo: 'doocs/leetcode',
@@ -81,9 +94,6 @@
       },
       plugins: [
         (hook, vm) => {
-
-          const isEn = () => vm.route.file.includes('README_EN')
-
           hook.beforeEach((html) => {
             const {file} =  vm.route
             const userContent = /githubusercontent\.com/.test(file)
diff --git a/lcof/summary_en.md b/lcof/summary_en.md
new file mode 100644
index 0000000000..ae44ef2a81
--- /dev/null
+++ b/lcof/summary_en.md
@@ -0,0 +1,76 @@
+-   LCOF Solutions
+    -   [03. 数组中重复的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9803.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E9%87%8D%E5%A4%8D%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
+    -   [04. 二维数组中的查找](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9804.%20%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E6%9F%A5%E6%89%BE/README.md)
+    -   [05. 替换空格](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9805.%20%E6%9B%BF%E6%8D%A2%E7%A9%BA%E6%A0%BC/README.md)
+    -   [06. 从尾到头打印链表](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9806.%20%E4%BB%8E%E5%B0%BE%E5%88%B0%E5%A4%B4%E6%89%93%E5%8D%B0%E9%93%BE%E8%A1%A8/README.md)
+    -   [07. 重建二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9807.%20%E9%87%8D%E5%BB%BA%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
+    -   [09. 用两个栈实现队列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9809.%20%E7%94%A8%E4%B8%A4%E4%B8%AA%E6%A0%88%E5%AE%9E%E7%8E%B0%E9%98%9F%E5%88%97/README.md)
+    -   [10- I. 斐波那契数列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9810-%20I.%20%E6%96%90%E6%B3%A2%E9%82%A3%E5%A5%91%E6%95%B0%E5%88%97/README.md)
+    -   [10- II. 青蛙跳台阶问题](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9810-%20II.%20%E9%9D%92%E8%9B%99%E8%B7%B3%E5%8F%B0%E9%98%B6%E9%97%AE%E9%A2%98/README.md)
+    -   [11. 旋转数组的最小数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9811.%20%E6%97%8B%E8%BD%AC%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%B0%8F%E6%95%B0%E5%AD%97/README.md)
+    -   [12. 矩阵中的路径](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9812.%20%E7%9F%A9%E9%98%B5%E4%B8%AD%E7%9A%84%E8%B7%AF%E5%BE%84/README.md)
+    -   [13. 机器人的运动范围](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9813.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E7%9A%84%E8%BF%90%E5%8A%A8%E8%8C%83%E5%9B%B4/README.md)
+    -   [14- I. 剪绳子](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9814-%20I.%20%E5%89%AA%E7%BB%B3%E5%AD%90/README.md)
+    -   [14- II. 剪绳子 II](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9814-%20II.%20%E5%89%AA%E7%BB%B3%E5%AD%90%20II/README.md)
+    -   [15. 二进制中 1 的个数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9815.%20%E4%BA%8C%E8%BF%9B%E5%88%B6%E4%B8%AD1%E7%9A%84%E4%B8%AA%E6%95%B0/README.md)
+    -   [16. 数值的整数次方](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9816.%20%E6%95%B0%E5%80%BC%E7%9A%84%E6%95%B4%E6%95%B0%E6%AC%A1%E6%96%B9/README.md)
+    -   [17. 打印从 1 到最大的 n 位数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9817.%20%E6%89%93%E5%8D%B0%E4%BB%8E1%E5%88%B0%E6%9C%80%E5%A4%A7%E7%9A%84n%E4%BD%8D%E6%95%B0/README.md)
+    -   [18. 删除链表的节点](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9818.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E8%8A%82%E7%82%B9/README.md)
+    -   [19. 正则表达式匹配](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9819.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D/README.md)
+    -   [20. 表示数值的字符串](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9820.%20%E8%A1%A8%E7%A4%BA%E6%95%B0%E5%80%BC%E7%9A%84%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md)
+    -   [21. 调整数组顺序使奇数位于偶数前面](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9821.%20%E8%B0%83%E6%95%B4%E6%95%B0%E7%BB%84%E9%A1%BA%E5%BA%8F%E4%BD%BF%E5%A5%87%E6%95%B0%E4%BD%8D%E4%BA%8E%E5%81%B6%E6%95%B0%E5%89%8D%E9%9D%A2/README.md)
+    -   [22. 链表中倒数第 k 个节点](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9822.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%ACk%E4%B8%AA%E8%8A%82%E7%82%B9/README.md)
+    -   [24. 反转链表](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9824.%20%E5%8F%8D%E8%BD%AC%E9%93%BE%E8%A1%A8/README.md)
+    -   [25. 合并两个排序的链表](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9825.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%8E%92%E5%BA%8F%E7%9A%84%E9%93%BE%E8%A1%A8/README.md)
+    -   [26. 树的子结构](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9826.%20%E6%A0%91%E7%9A%84%E5%AD%90%E7%BB%93%E6%9E%84/README.md)
+    -   [27. 二叉树的镜像](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9827.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%95%9C%E5%83%8F/README.md)
+    -   [28. 对称的二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9828.%20%E5%AF%B9%E7%A7%B0%E7%9A%84%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
+    -   [29. 顺时针打印矩阵](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9829.%20%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5/README.md)
+    -   [30. 包含 min 函数的栈](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9830.%20%E5%8C%85%E5%90%ABmin%E5%87%BD%E6%95%B0%E7%9A%84%E6%A0%88/README.md)
+    -   [31. 栈的压入、弹出序列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9831.%20%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E3%80%81%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97/README.md)
+    -   [32 - I. 从上到下打印二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20I.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
+    -   [32 - II. 从上到下打印二叉树 II](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20II.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20II/README.md)
+    -   [32 - III. 从上到下打印二叉树 III](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9832%20-%20III.%20%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III/README.md)
+    -   [33. 二叉搜索树的后序遍历序列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9833.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97/README.md)
+    -   [34. 二叉树中和为某一值的路径](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9834.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E5%92%8C%E4%B8%BA%E6%9F%90%E4%B8%80%E5%80%BC%E7%9A%84%E8%B7%AF%E5%BE%84/README.md)
+    -   [35. 复杂链表的复制](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9835.%20%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6/README.md)
+    -   [36. 二叉搜索树与双向链表](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9836.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%8E%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8/README.md)
+    -   [37. 序列化二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9837.%20%E5%BA%8F%E5%88%97%E5%8C%96%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
+    -   [38. 字符串的排列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9838.%20%E5%AD%97%E7%AC%A6%E4%B8%B2%E7%9A%84%E6%8E%92%E5%88%97/README.md)
+    -   [39. 数组中出现次数超过一半的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9839.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E5%87%BA%E7%8E%B0%E6%AC%A1%E6%95%B0%E8%B6%85%E8%BF%87%E4%B8%80%E5%8D%8A%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
+    -   [40. 最小的 k 个数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9840.%20%E6%9C%80%E5%B0%8F%E7%9A%84k%E4%B8%AA%E6%95%B0/README.md)
+    -   [41. 数据流中的中位数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9841.%20%E6%95%B0%E6%8D%AE%E6%B5%81%E4%B8%AD%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0/README.md)
+    -   [42. 连续子数组的最大和](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9842.%20%E8%BF%9E%E7%BB%AD%E5%AD%90%E6%95%B0%E7%BB%84%E7%9A%84%E6%9C%80%E5%A4%A7%E5%92%8C/README.md)
+    -   [43. 1 ～ n 整数中 1 出现的次数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9843.%201%EF%BD%9En%E6%95%B4%E6%95%B0%E4%B8%AD1%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0/README.md)
+    -   [44. 数字序列中某一位的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9844.%20%E6%95%B0%E5%AD%97%E5%BA%8F%E5%88%97%E4%B8%AD%E6%9F%90%E4%B8%80%E4%BD%8D%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
+    -   [45. 把数组排成最小的数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9845.%20%E6%8A%8A%E6%95%B0%E7%BB%84%E6%8E%92%E6%88%90%E6%9C%80%E5%B0%8F%E7%9A%84%E6%95%B0/README.md)
+    -   [46. 把数字翻译成字符串](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9846.%20%E6%8A%8A%E6%95%B0%E5%AD%97%E7%BF%BB%E8%AF%91%E6%88%90%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md)
+    -   [47. 礼物的最大价值](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9847.%20%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC/README.md)
+    -   [48. 最长不含重复字符的子字符串](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9848.%20%E6%9C%80%E9%95%BF%E4%B8%8D%E5%90%AB%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E5%AD%90%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md)
+    -   [49. 丑数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9849.%20%E4%B8%91%E6%95%B0/README.md)
+    -   [50. 第一个只出现一次的字符](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9850.%20%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%8F%AA%E5%87%BA%E7%8E%B0%E4%B8%80%E6%AC%A1%E7%9A%84%E5%AD%97%E7%AC%A6/README.md)
+    -   [51. 数组中的逆序对](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9851.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E7%9A%84%E9%80%86%E5%BA%8F%E5%AF%B9/README.md)
+    -   [52. 两个链表的第一个公共节点](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9852.%20%E4%B8%A4%E4%B8%AA%E9%93%BE%E8%A1%A8%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%85%AC%E5%85%B1%E8%8A%82%E7%82%B9/README.md)
+    -   [53 - I. 在排序数组中查找数字 I](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9853%20-%20I.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E6%95%B0%E5%AD%97%20I/README.md)
+    -   [53 - II. 0 ～ n-1 中缺失的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9853%20-%20II.%200%EF%BD%9En-1%E4%B8%AD%E7%BC%BA%E5%A4%B1%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
+    -   [54. 二叉搜索树的第 k 大节点](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9854.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E7%AC%ACk%E5%A4%A7%E8%8A%82%E7%82%B9/README.md)
+    -   [55 - I. 二叉树的深度](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9855%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%B7%B1%E5%BA%A6/README.md)
+    -   [55 - II. 平衡二叉树](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9855%20-%20II.%20%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91/README.md)
+    -   [56 - I. 数组中数字出现的次数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9856%20-%20I.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0/README.md)
+    -   [56 - II. 数组中数字出现的次数 II](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9856%20-%20II.%20%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0%20II/README.md)
+    -   [57. 和为 s 的两个数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9857.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E4%B8%A4%E4%B8%AA%E6%95%B0%E5%AD%97/README.md)
+    -   [57 - II. 和为 s 的连续正数序列](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9857%20-%20II.%20%E5%92%8C%E4%B8%BAs%E7%9A%84%E8%BF%9E%E7%BB%AD%E6%AD%A3%E6%95%B0%E5%BA%8F%E5%88%97/README.md)
+    -   [58 - I. 翻转单词顺序](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9858%20-%20I.%20%E7%BF%BB%E8%BD%AC%E5%8D%95%E8%AF%8D%E9%A1%BA%E5%BA%8F/README.md)
+    -   [58 - II. 左旋转字符串](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9858%20-%20II.%20%E5%B7%A6%E6%97%8B%E8%BD%AC%E5%AD%97%E7%AC%A6%E4%B8%B2/README.md)
+    -   [59 - I. 滑动窗口的最大值](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9859%20-%20I.%20%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC/README.md)
+    -   [59 - II. 队列的最大值](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9859%20-%20II.%20%E9%98%9F%E5%88%97%E7%9A%84%E6%9C%80%E5%A4%A7%E5%80%BC/README.md)
+    -   [60. n 个骰子的点数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9860.%20n%E4%B8%AA%E9%AA%B0%E5%AD%90%E7%9A%84%E7%82%B9%E6%95%B0/README.md)
+    -   [61. 扑克牌中的顺子](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9861.%20%E6%89%91%E5%85%8B%E7%89%8C%E4%B8%AD%E7%9A%84%E9%A1%BA%E5%AD%90/README.md)
+    -   [62. 圆圈中最后剩下的数字](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9862.%20%E5%9C%86%E5%9C%88%E4%B8%AD%E6%9C%80%E5%90%8E%E5%89%A9%E4%B8%8B%E7%9A%84%E6%95%B0%E5%AD%97/README.md)
+    -   [63. 股票的最大利润](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9863.%20%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6/README.md)
+    -   [64. 求 1+2+…+n](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9864.%20%E6%B1%821%2B2%2B%E2%80%A6%2Bn/README.md)
+    -   [65. 不用加减乘除做加法](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9865.%20%E4%B8%8D%E7%94%A8%E5%8A%A0%E5%87%8F%E4%B9%98%E9%99%A4%E5%81%9A%E5%8A%A0%E6%B3%95/README.md)
+    -   [66. 构建乘积数组](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9866.%20%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84/README.md)
+    -   [67. 把字符串转换成整数](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9867.%20%E6%8A%8A%E5%AD%97%E7%AC%A6%E4%B8%B2%E8%BD%AC%E6%8D%A2%E6%88%90%E6%95%B4%E6%95%B0/README.md)
+    -   [68 - I. 二叉搜索树的最近公共祖先](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9868%20-%20I.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88/README.md)
+    -   [68 - II. 二叉树的最近公共祖先](/lcof/%E9%9D%A2%E8%AF%95%E9%A2%9868%20-%20II.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88/README.md)
diff --git a/lcp/summary_en.md b/lcp/summary_en.md
new file mode 100644
index 0000000000..79f1b8638e
--- /dev/null
+++ b/lcp/summary_en.md
@@ -0,0 +1,50 @@
+-   LCP Solutions
+    -   [LCP 01. 猜数字](/lcp/LCP%2001.%20%E7%8C%9C%E6%95%B0%E5%AD%97/README.md)
+    -   [LCP 02. 分式化简](/lcp/LCP%2002.%20%E5%88%86%E5%BC%8F%E5%8C%96%E7%AE%80/README.md)
+    -   [LCP 03. 机器人大冒险](/lcp/LCP%2003.%20%E6%9C%BA%E5%99%A8%E4%BA%BA%E5%A4%A7%E5%86%92%E9%99%A9/README.md)
+    -   [LCP 04. 覆盖](/lcp/LCP%2004.%20%E8%A6%86%E7%9B%96/README.md)
+    -   [LCP 05. 发 LeetCoin](/lcp/LCP%2005.%20%E5%8F%91%20LeetCoin/README.md)
+    -   [LCP 06. 拿硬币](/lcp/LCP%2006.%20%E6%8B%BF%E7%A1%AC%E5%B8%81/README.md)
+    -   [LCP 07. 传递信息](/lcp/LCP%2007.%20%E4%BC%A0%E9%80%92%E4%BF%A1%E6%81%AF/README.md)
+    -   [LCP 08. 剧情触发时间](/lcp/LCP%2008.%20%E5%89%A7%E6%83%85%E8%A7%A6%E5%8F%91%E6%97%B6%E9%97%B4/README.md)
+    -   [LCP 09. 最小跳跃次数](/lcp/LCP%2009.%20%E6%9C%80%E5%B0%8F%E8%B7%B3%E8%B7%83%E6%AC%A1%E6%95%B0/README.md)
+    -   [LCP 10. 二叉树任务调度](/lcp/LCP%2010.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E4%BB%BB%E5%8A%A1%E8%B0%83%E5%BA%A6/README.md)
+    -   [LCP 11. 期望个数统计](/lcp/LCP%2011.%20%E6%9C%9F%E6%9C%9B%E4%B8%AA%E6%95%B0%E7%BB%9F%E8%AE%A1/README.md)
+    -   [LCP 12. 小张刷题计划](/lcp/LCP%2012.%20%E5%B0%8F%E5%BC%A0%E5%88%B7%E9%A2%98%E8%AE%A1%E5%88%92/README.md)
+    -   [LCP 13. 寻宝](/lcp/LCP%2013.%20%E5%AF%BB%E5%AE%9D/README.md)
+    -   [LCP 14. 切分数组](/lcp/LCP%2014.%20%E5%88%87%E5%88%86%E6%95%B0%E7%BB%84/README.md)
+    -   [LCP 15. 游乐园的迷宫](/lcp/LCP%2015.%20%E6%B8%B8%E4%B9%90%E5%9B%AD%E7%9A%84%E8%BF%B7%E5%AE%AB/README.md)
+    -   [LCP 16. 游乐园的游览计划](/lcp/LCP%2016.%20%E6%B8%B8%E4%B9%90%E5%9B%AD%E7%9A%84%E6%B8%B8%E8%A7%88%E8%AE%A1%E5%88%92/README.md)
+    -   [LCP 17. 速算机器人](/lcp/LCP%2017.%20%E9%80%9F%E7%AE%97%E6%9C%BA%E5%99%A8%E4%BA%BA/README.md)
+    -   [LCP 18. 早餐组合](/lcp/LCP%2018.%20%E6%97%A9%E9%A4%90%E7%BB%84%E5%90%88/README.md)
+    -   [LCP 19. 秋叶收藏集](/lcp/LCP%2019.%20%E7%A7%8B%E5%8F%B6%E6%94%B6%E8%97%8F%E9%9B%86/README.md)
+    -   [LCP 20. 快速公交](/lcp/LCP%2020.%20%E5%BF%AB%E9%80%9F%E5%85%AC%E4%BA%A4/README.md)
+    -   [LCP 21. 追逐游戏](/lcp/LCP%2021.%20%E8%BF%BD%E9%80%90%E6%B8%B8%E6%88%8F/README.md)
+    -   [LCP 22. 黑白方格画](/lcp/LCP%2022.%20%E9%BB%91%E7%99%BD%E6%96%B9%E6%A0%BC%E7%94%BB/README.md)
+    -   [LCP 23. 魔术排列](/lcp/LCP%2023.%20%E9%AD%94%E6%9C%AF%E6%8E%92%E5%88%97/README.md)
+    -   [LCP 24. 数字游戏](/lcp/LCP%2024.%20%E6%95%B0%E5%AD%97%E6%B8%B8%E6%88%8F/README.md)
+    -   [LCP 25. 古董键盘](/lcp/LCP%2025.%20%E5%8F%A4%E8%91%A3%E9%94%AE%E7%9B%98/README.md)
+    -   [LCP 26. 导航装置](/lcp/LCP%2026.%20%E5%AF%BC%E8%88%AA%E8%A3%85%E7%BD%AE/README.md)
+    -   [LCP 27. 黑盒光线反射](/lcp/LCP%2027.%20%E9%BB%91%E7%9B%92%E5%85%89%E7%BA%BF%E5%8F%8D%E5%B0%84/README.md)
+    -   [LCP 28. 采购方案](/lcp/LCP%2028.%20%E9%87%87%E8%B4%AD%E6%96%B9%E6%A1%88/README.md)
+    -   [LCP 29. 乐团站位](/lcp/LCP%2029.%20%E4%B9%90%E5%9B%A2%E7%AB%99%E4%BD%8D/README.md)
+    -   [LCP 30. 魔塔游戏](/lcp/LCP%2030.%20%E9%AD%94%E5%A1%94%E6%B8%B8%E6%88%8F/README.md)
+    -   [LCP 31. 变换的迷宫](/lcp/LCP%2031.%20%E5%8F%98%E6%8D%A2%E7%9A%84%E8%BF%B7%E5%AE%AB/README.md)
+    -   [LCP 32. 批量处理任务](/lcp/LCP%2032.%20%E6%89%B9%E9%87%8F%E5%A4%84%E7%90%86%E4%BB%BB%E5%8A%A1/README.md)
+    -   [LCP 33. 蓄水](/lcp/LCP%2033.%20%E8%93%84%E6%B0%B4/README.md)
+    -   [LCP 34. 二叉树染色](/lcp/LCP%2034.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E6%9F%93%E8%89%B2/README.md)
+    -   [LCP 35. 电动车游城市](/lcp/LCP%2035.%20%E7%94%B5%E5%8A%A8%E8%BD%A6%E6%B8%B8%E5%9F%8E%E5%B8%82/README.md)
+    -   [LCP 36. 最多牌组数](/lcp/LCP%2036.%20%E6%9C%80%E5%A4%9A%E7%89%8C%E7%BB%84%E6%95%B0/README.md)
+    -   [LCP 37. 最小矩形面积](/lcp/LCP%2037.%20%E6%9C%80%E5%B0%8F%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF/README.md)
+    -   [LCP 38. 守卫城堡](/lcp/LCP%2038.%20%E5%AE%88%E5%8D%AB%E5%9F%8E%E5%A0%A1/README.md)
+    -   [LCP 39. 无人机方阵](/lcp/LCP%2039.%20%E6%97%A0%E4%BA%BA%E6%9C%BA%E6%96%B9%E9%98%B5/README.md)
+    -   [LCP 40. 心算挑战](/lcp/LCP%2040.%20%E5%BF%83%E7%AE%97%E6%8C%91%E6%88%98/README.md)
+    -   [LCP 41. 黑白翻转棋](/lcp/LCP%2041.%20%E9%BB%91%E7%99%BD%E7%BF%BB%E8%BD%AC%E6%A3%8B/README.md)
+    -   [LCP 42. 玩具套圈](/lcp/LCP%2042.%20%E7%8E%A9%E5%85%B7%E5%A5%97%E5%9C%88/README.md)
+    -   [LCP 43. 十字路口的交通](/lcp/LCP%2043.%20%E5%8D%81%E5%AD%97%E8%B7%AF%E5%8F%A3%E7%9A%84%E4%BA%A4%E9%80%9A/README.md)
+    -   [LCP 44. 开幕式焰火](/lcp/LCP%2044.%20%E5%BC%80%E5%B9%95%E5%BC%8F%E7%84%B0%E7%81%AB/README.md)
+    -   [LCP 45. 自行车炫技赛场](/lcp/LCP%2045.%20%E8%87%AA%E8%A1%8C%E8%BD%A6%E7%82%AB%E6%8A%80%E8%B5%9B%E5%9C%BA/README.md)
+    -   [LCP 46. 志愿者调配](/lcp/LCP%2046.%20%E5%BF%97%E6%84%BF%E8%80%85%E8%B0%83%E9%85%8D/README.md)
+    -   [LCP 47. 入场安检](/lcp/LCP%2047.%20%E5%85%A5%E5%9C%BA%E5%AE%89%E6%A3%80/README.md)
+    -   [LCP 48. 无限棋局](/lcp/LCP%2048.%20%E6%97%A0%E9%99%90%E6%A3%8B%E5%B1%80/README.md)
+    -   [LCP 49. 环形闯关游戏](/lcp/LCP%2049.%20%E7%8E%AF%E5%BD%A2%E9%97%AF%E5%85%B3%E6%B8%B8%E6%88%8F/README.md)
diff --git a/lcs/summary_en.md b/lcs/summary_en.md
new file mode 100644
index 0000000000..d1e9837c83
--- /dev/null
+++ b/lcs/summary_en.md
@@ -0,0 +1,4 @@
+-   LCS Solutions
+    -   [LCS 01. 下载插件](/lcs/LCS%2001.%20%E4%B8%8B%E8%BD%BD%E6%8F%92%E4%BB%B6/README.md)
+    -   [LCS 02. 完成一半题目](/lcs/LCS%2002.%20%E5%AE%8C%E6%88%90%E4%B8%80%E5%8D%8A%E9%A2%98%E7%9B%AE/README.md)
+    -   [LCS 03. 主题空间](/lcs/LCS%2003.%20%E4%B8%BB%E9%A2%98%E7%A9%BA%E9%97%B4/README.md)
diff --git a/solution/main.py b/solution/main.py
index aacdb76d86..ee530c82a6 100644
--- a/solution/main.py
+++ b/solution/main.py
@@ -316,6 +316,11 @@ class LCSpider:
         """generate summary files"""
         summary_cn = ''
         summary_en = ''
+
+        with open('./result.json', 'r', encoding='utf-8') as f:
+            result = f.read()
+            result = json.loads(result)
+        m = {int(item['frontend_question_id']):item for item in result}
         for file in os.listdir('./'):
             if os.path.isdir("./" + file) and file != '__pycache__':
                 summary_cn += f'\n- {file}\n'
@@ -323,7 +328,13 @@ class LCSpider:
                 for sub in os.listdir('./' + file):
                     sub = sub.replace('`', ' ')
                     enc = quote(sub)
-                    summary_cn += f'  - [{sub}](/solution/{file}/{enc}/README.md)\n'
+
+                    data = m.get(int(sub[:4]))
+                    sub_cn = sub
+                    if data:
+                        sub_cn = sub[:5] + data['title_cn']
+
+                    summary_cn += f'  - [{sub_cn}](/solution/{file}/{enc}/README.md)\n'
                     summary_en += f'  - [{sub}](/solution/{file}/{enc}/README_EN.md)\n'
 
         # generate summary.md
diff --git a/solution/summary.md b/solution/summary.md
index 179fd5af24..9ddfe01a9c 100644
--- a/solution/summary.md
+++ b/solution/summary.md
@@ -1,2280 +1,2280 @@
 
 - 0000-0099
-  - [0001.Two Sum](/solution/0000-0099/0001.Two%20Sum/README.md)
-  - [0002.Add Two Numbers](/solution/0000-0099/0002.Add%20Two%20Numbers/README.md)
-  - [0003.Longest Substring Without Repeating Characters](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md)
-  - [0004.Median of Two Sorted Arrays](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README.md)
-  - [0005.Longest Palindromic Substring](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md)
-  - [0006.ZigZag Conversion](/solution/0000-0099/0006.ZigZag%20Conversion/README.md)
-  - [0007.Reverse Integer](/solution/0000-0099/0007.Reverse%20Integer/README.md)
-  - [0008.String to Integer (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md)
-  - [0009.Palindrome Number](/solution/0000-0099/0009.Palindrome%20Number/README.md)
-  - [0010.Regular Expression Matching](/solution/0000-0099/0010.Regular%20Expression%20Matching/README.md)
-  - [0011.Container With Most Water](/solution/0000-0099/0011.Container%20With%20Most%20Water/README.md)
-  - [0012.Integer to Roman](/solution/0000-0099/0012.Integer%20to%20Roman/README.md)
-  - [0013.Roman to Integer](/solution/0000-0099/0013.Roman%20to%20Integer/README.md)
-  - [0014.Longest Common Prefix](/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md)
-  - [0015.3Sum](/solution/0000-0099/0015.3Sum/README.md)
-  - [0016.3Sum Closest](/solution/0000-0099/0016.3Sum%20Closest/README.md)
-  - [0017.Letter Combinations of a Phone Number](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README.md)
-  - [0018.4Sum](/solution/0000-0099/0018.4Sum/README.md)
-  - [0019.Remove Nth Node From End of List](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README.md)
-  - [0020.Valid Parentheses](/solution/0000-0099/0020.Valid%20Parentheses/README.md)
-  - [0021.Merge Two Sorted Lists](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README.md)
-  - [0022.Generate Parentheses](/solution/0000-0099/0022.Generate%20Parentheses/README.md)
-  - [0023.Merge k Sorted Lists](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README.md)
-  - [0024.Swap Nodes in Pairs](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README.md)
-  - [0025.Reverse Nodes in k-Group](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README.md)
-  - [0026.Remove Duplicates from Sorted Array](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md)
-  - [0027.Remove Element](/solution/0000-0099/0027.Remove%20Element/README.md)
-  - [0028.Implement strStr()](/solution/0000-0099/0028.Implement%20strStr%28%29/README.md)
-  - [0029.Divide Two Integers](/solution/0000-0099/0029.Divide%20Two%20Integers/README.md)
-  - [0030.Substring with Concatenation of All Words](/solution/0000-0099/0030.Substring%20with%20Concatenation%20of%20All%20Words/README.md)
-  - [0031.Next Permutation](/solution/0000-0099/0031.Next%20Permutation/README.md)
-  - [0032.Longest Valid Parentheses](/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README.md)
-  - [0033.Search in Rotated Sorted Array](/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README.md)
-  - [0034.Find First and Last Position of Element in Sorted Array](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md)
-  - [0035.Search Insert Position](/solution/0000-0099/0035.Search%20Insert%20Position/README.md)
-  - [0036.Valid Sudoku](/solution/0000-0099/0036.Valid%20Sudoku/README.md)
-  - [0037.Sudoku Solver](/solution/0000-0099/0037.Sudoku%20Solver/README.md)
-  - [0038.Count and Say](/solution/0000-0099/0038.Count%20and%20Say/README.md)
-  - [0039.Combination Sum](/solution/0000-0099/0039.Combination%20Sum/README.md)
-  - [0040.Combination Sum II](/solution/0000-0099/0040.Combination%20Sum%20II/README.md)
-  - [0041.First Missing Positive](/solution/0000-0099/0041.First%20Missing%20Positive/README.md)
-  - [0042.Trapping Rain Water](/solution/0000-0099/0042.Trapping%20Rain%20Water/README.md)
-  - [0043.Multiply Strings](/solution/0000-0099/0043.Multiply%20Strings/README.md)
-  - [0044.Wildcard Matching](/solution/0000-0099/0044.Wildcard%20Matching/README.md)
-  - [0045.Jump Game II](/solution/0000-0099/0045.Jump%20Game%20II/README.md)
-  - [0046.Permutations](/solution/0000-0099/0046.Permutations/README.md)
-  - [0047.Permutations II](/solution/0000-0099/0047.Permutations%20II/README.md)
-  - [0048.Rotate Image](/solution/0000-0099/0048.Rotate%20Image/README.md)
-  - [0049.Group Anagrams](/solution/0000-0099/0049.Group%20Anagrams/README.md)
+  - [0001.两数之和](/solution/0000-0099/0001.Two%20Sum/README.md)
+  - [0002.两数相加](/solution/0000-0099/0002.Add%20Two%20Numbers/README.md)
+  - [0003.无重复字符的最长子串](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md)
+  - [0004.寻找两个正序数组的中位数](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README.md)
+  - [0005.最长回文子串](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md)
+  - [0006.Z 字形变换](/solution/0000-0099/0006.ZigZag%20Conversion/README.md)
+  - [0007.整数反转](/solution/0000-0099/0007.Reverse%20Integer/README.md)
+  - [0008.字符串转换整数 (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md)
+  - [0009.回文数](/solution/0000-0099/0009.Palindrome%20Number/README.md)
+  - [0010.正则表达式匹配](/solution/0000-0099/0010.Regular%20Expression%20Matching/README.md)
+  - [0011.盛最多水的容器](/solution/0000-0099/0011.Container%20With%20Most%20Water/README.md)
+  - [0012.整数转罗马数字](/solution/0000-0099/0012.Integer%20to%20Roman/README.md)
+  - [0013.罗马数字转整数](/solution/0000-0099/0013.Roman%20to%20Integer/README.md)
+  - [0014.最长公共前缀](/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md)
+  - [0015.三数之和](/solution/0000-0099/0015.3Sum/README.md)
+  - [0016.最接近的三数之和](/solution/0000-0099/0016.3Sum%20Closest/README.md)
+  - [0017.电话号码的字母组合](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README.md)
+  - [0018.四数之和](/solution/0000-0099/0018.4Sum/README.md)
+  - [0019.删除链表的倒数第 N 个结点](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README.md)
+  - [0020.有效的括号](/solution/0000-0099/0020.Valid%20Parentheses/README.md)
+  - [0021.合并两个有序链表](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README.md)
+  - [0022.括号生成](/solution/0000-0099/0022.Generate%20Parentheses/README.md)
+  - [0023.合并K个升序链表](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README.md)
+  - [0024.两两交换链表中的节点](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README.md)
+  - [0025.K 个一组翻转链表](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README.md)
+  - [0026.删除有序数组中的重复项](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md)
+  - [0027.移除元素](/solution/0000-0099/0027.Remove%20Element/README.md)
+  - [0028.实现 strStr()](/solution/0000-0099/0028.Implement%20strStr%28%29/README.md)
+  - [0029.两数相除](/solution/0000-0099/0029.Divide%20Two%20Integers/README.md)
+  - [0030.串联所有单词的子串](/solution/0000-0099/0030.Substring%20with%20Concatenation%20of%20All%20Words/README.md)
+  - [0031.下一个排列](/solution/0000-0099/0031.Next%20Permutation/README.md)
+  - [0032.最长有效括号](/solution/0000-0099/0032.Longest%20Valid%20Parentheses/README.md)
+  - [0033.搜索旋转排序数组](/solution/0000-0099/0033.Search%20in%20Rotated%20Sorted%20Array/README.md)
+  - [0034.在排序数组中查找元素的第一个和最后一个位置](/solution/0000-0099/0034.Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/README.md)
+  - [0035.搜索插入位置](/solution/0000-0099/0035.Search%20Insert%20Position/README.md)
+  - [0036.有效的数独](/solution/0000-0099/0036.Valid%20Sudoku/README.md)
+  - [0037.解数独](/solution/0000-0099/0037.Sudoku%20Solver/README.md)
+  - [0038.外观数列](/solution/0000-0099/0038.Count%20and%20Say/README.md)
+  - [0039.组合总和](/solution/0000-0099/0039.Combination%20Sum/README.md)
+  - [0040.组合总和 II](/solution/0000-0099/0040.Combination%20Sum%20II/README.md)
+  - [0041.缺失的第一个正数](/solution/0000-0099/0041.First%20Missing%20Positive/README.md)
+  - [0042.接雨水](/solution/0000-0099/0042.Trapping%20Rain%20Water/README.md)
+  - [0043.字符串相乘](/solution/0000-0099/0043.Multiply%20Strings/README.md)
+  - [0044.通配符匹配](/solution/0000-0099/0044.Wildcard%20Matching/README.md)
+  - [0045.跳跃游戏 II](/solution/0000-0099/0045.Jump%20Game%20II/README.md)
+  - [0046.全排列](/solution/0000-0099/0046.Permutations/README.md)
+  - [0047.全排列 II](/solution/0000-0099/0047.Permutations%20II/README.md)
+  - [0048.旋转图像](/solution/0000-0099/0048.Rotate%20Image/README.md)
+  - [0049.字母异位词分组](/solution/0000-0099/0049.Group%20Anagrams/README.md)
   - [0050.Pow(x, n)](/solution/0000-0099/0050.Pow%28x%2C%20n%29/README.md)
-  - [0051.N-Queens](/solution/0000-0099/0051.N-Queens/README.md)
-  - [0052.N-Queens II](/solution/0000-0099/0052.N-Queens%20II/README.md)
-  - [0053.Maximum Subarray](/solution/0000-0099/0053.Maximum%20Subarray/README.md)
-  - [0054.Spiral Matrix](/solution/0000-0099/0054.Spiral%20Matrix/README.md)
-  - [0055.Jump Game](/solution/0000-0099/0055.Jump%20Game/README.md)
-  - [0056.Merge Intervals](/solution/0000-0099/0056.Merge%20Intervals/README.md)
-  - [0057.Insert Interval](/solution/0000-0099/0057.Insert%20Interval/README.md)
-  - [0058.Length of Last Word](/solution/0000-0099/0058.Length%20of%20Last%20Word/README.md)
-  - [0059.Spiral Matrix II](/solution/0000-0099/0059.Spiral%20Matrix%20II/README.md)
-  - [0060.Permutation Sequence](/solution/0000-0099/0060.Permutation%20Sequence/README.md)
-  - [0061.Rotate List](/solution/0000-0099/0061.Rotate%20List/README.md)
-  - [0062.Unique Paths](/solution/0000-0099/0062.Unique%20Paths/README.md)
-  - [0063.Unique Paths II](/solution/0000-0099/0063.Unique%20Paths%20II/README.md)
-  - [0064.Minimum Path Sum](/solution/0000-0099/0064.Minimum%20Path%20Sum/README.md)
-  - [0065.Valid Number](/solution/0000-0099/0065.Valid%20Number/README.md)
-  - [0066.Plus One](/solution/0000-0099/0066.Plus%20One/README.md)
-  - [0067.Add Binary](/solution/0000-0099/0067.Add%20Binary/README.md)
-  - [0068.Text Justification](/solution/0000-0099/0068.Text%20Justification/README.md)
-  - [0069.Sqrt(x)](/solution/0000-0099/0069.Sqrt%28x%29/README.md)
-  - [0070.Climbing Stairs](/solution/0000-0099/0070.Climbing%20Stairs/README.md)
-  - [0071.Simplify Path](/solution/0000-0099/0071.Simplify%20Path/README.md)
-  - [0072.Edit Distance](/solution/0000-0099/0072.Edit%20Distance/README.md)
-  - [0073.Set Matrix Zeroes](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README.md)
-  - [0074.Search a 2D Matrix](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README.md)
-  - [0075.Sort Colors](/solution/0000-0099/0075.Sort%20Colors/README.md)
-  - [0076.Minimum Window Substring](/solution/0000-0099/0076.Minimum%20Window%20Substring/README.md)
-  - [0077.Combinations](/solution/0000-0099/0077.Combinations/README.md)
-  - [0078.Subsets](/solution/0000-0099/0078.Subsets/README.md)
-  - [0079.Word Search](/solution/0000-0099/0079.Word%20Search/README.md)
-  - [0080.Remove Duplicates from Sorted Array II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md)
-  - [0081.Search in Rotated Sorted Array II](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README.md)
-  - [0082.Remove Duplicates from Sorted List II](/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README.md)
-  - [0083.Remove Duplicates from Sorted List](/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README.md)
-  - [0084.Largest Rectangle in Histogram](/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README.md)
-  - [0085.Maximal Rectangle](/solution/0000-0099/0085.Maximal%20Rectangle/README.md)
-  - [0086.Partition List](/solution/0000-0099/0086.Partition%20List/README.md)
-  - [0087.Scramble String](/solution/0000-0099/0087.Scramble%20String/README.md)
-  - [0088.Merge Sorted Array](/solution/0000-0099/0088.Merge%20Sorted%20Array/README.md)
-  - [0089.Gray Code](/solution/0000-0099/0089.Gray%20Code/README.md)
-  - [0090.Subsets II](/solution/0000-0099/0090.Subsets%20II/README.md)
-  - [0091.Decode Ways](/solution/0000-0099/0091.Decode%20Ways/README.md)
-  - [0092.Reverse Linked List II](/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README.md)
-  - [0093.Restore IP Addresses](/solution/0000-0099/0093.Restore%20IP%20Addresses/README.md)
-  - [0094.Binary Tree Inorder Traversal](/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README.md)
-  - [0095.Unique Binary Search Trees II](/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README.md)
-  - [0096.Unique Binary Search Trees](/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README.md)
-  - [0097.Interleaving String](/solution/0000-0099/0097.Interleaving%20String/README.md)
-  - [0098.Validate Binary Search Tree](/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README.md)
-  - [0099.Recover Binary Search Tree](/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README.md)
+  - [0051.N 皇后](/solution/0000-0099/0051.N-Queens/README.md)
+  - [0052.N皇后 II](/solution/0000-0099/0052.N-Queens%20II/README.md)
+  - [0053.最大子数组和](/solution/0000-0099/0053.Maximum%20Subarray/README.md)
+  - [0054.螺旋矩阵](/solution/0000-0099/0054.Spiral%20Matrix/README.md)
+  - [0055.跳跃游戏](/solution/0000-0099/0055.Jump%20Game/README.md)
+  - [0056.合并区间](/solution/0000-0099/0056.Merge%20Intervals/README.md)
+  - [0057.插入区间](/solution/0000-0099/0057.Insert%20Interval/README.md)
+  - [0058.最后一个单词的长度](/solution/0000-0099/0058.Length%20of%20Last%20Word/README.md)
+  - [0059.螺旋矩阵 II](/solution/0000-0099/0059.Spiral%20Matrix%20II/README.md)
+  - [0060.排列序列](/solution/0000-0099/0060.Permutation%20Sequence/README.md)
+  - [0061.旋转链表](/solution/0000-0099/0061.Rotate%20List/README.md)
+  - [0062.不同路径](/solution/0000-0099/0062.Unique%20Paths/README.md)
+  - [0063.不同路径 II](/solution/0000-0099/0063.Unique%20Paths%20II/README.md)
+  - [0064.最小路径和](/solution/0000-0099/0064.Minimum%20Path%20Sum/README.md)
+  - [0065.有效数字](/solution/0000-0099/0065.Valid%20Number/README.md)
+  - [0066.加一](/solution/0000-0099/0066.Plus%20One/README.md)
+  - [0067.二进制求和](/solution/0000-0099/0067.Add%20Binary/README.md)
+  - [0068.文本左右对齐](/solution/0000-0099/0068.Text%20Justification/README.md)
+  - [0069.x 的平方根 ](/solution/0000-0099/0069.Sqrt%28x%29/README.md)
+  - [0070.爬楼梯](/solution/0000-0099/0070.Climbing%20Stairs/README.md)
+  - [0071.简化路径](/solution/0000-0099/0071.Simplify%20Path/README.md)
+  - [0072.编辑距离](/solution/0000-0099/0072.Edit%20Distance/README.md)
+  - [0073.矩阵置零](/solution/0000-0099/0073.Set%20Matrix%20Zeroes/README.md)
+  - [0074.搜索二维矩阵](/solution/0000-0099/0074.Search%20a%202D%20Matrix/README.md)
+  - [0075.颜色分类](/solution/0000-0099/0075.Sort%20Colors/README.md)
+  - [0076.最小覆盖子串](/solution/0000-0099/0076.Minimum%20Window%20Substring/README.md)
+  - [0077.组合](/solution/0000-0099/0077.Combinations/README.md)
+  - [0078.子集](/solution/0000-0099/0078.Subsets/README.md)
+  - [0079.单词搜索](/solution/0000-0099/0079.Word%20Search/README.md)
+  - [0080.删除有序数组中的重复项 II](/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README.md)
+  - [0081.搜索旋转排序数组 II](/solution/0000-0099/0081.Search%20in%20Rotated%20Sorted%20Array%20II/README.md)
+  - [0082.删除排序链表中的重复元素 II](/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README.md)
+  - [0083.删除排序链表中的重复元素](/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README.md)
+  - [0084.柱状图中最大的矩形](/solution/0000-0099/0084.Largest%20Rectangle%20in%20Histogram/README.md)
+  - [0085.最大矩形](/solution/0000-0099/0085.Maximal%20Rectangle/README.md)
+  - [0086.分隔链表](/solution/0000-0099/0086.Partition%20List/README.md)
+  - [0087.扰乱字符串](/solution/0000-0099/0087.Scramble%20String/README.md)
+  - [0088.合并两个有序数组](/solution/0000-0099/0088.Merge%20Sorted%20Array/README.md)
+  - [0089.格雷编码](/solution/0000-0099/0089.Gray%20Code/README.md)
+  - [0090.子集 II](/solution/0000-0099/0090.Subsets%20II/README.md)
+  - [0091.解码方法](/solution/0000-0099/0091.Decode%20Ways/README.md)
+  - [0092.反转链表 II](/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README.md)
+  - [0093.复原 IP 地址](/solution/0000-0099/0093.Restore%20IP%20Addresses/README.md)
+  - [0094.二叉树的中序遍历](/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README.md)
+  - [0095.不同的二叉搜索树 II](/solution/0000-0099/0095.Unique%20Binary%20Search%20Trees%20II/README.md)
+  - [0096.不同的二叉搜索树](/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README.md)
+  - [0097.交错字符串](/solution/0000-0099/0097.Interleaving%20String/README.md)
+  - [0098.验证二叉搜索树](/solution/0000-0099/0098.Validate%20Binary%20Search%20Tree/README.md)
+  - [0099.恢复二叉搜索树](/solution/0000-0099/0099.Recover%20Binary%20Search%20Tree/README.md)
 
 - 0100-0199
-  - [0100.Same Tree](/solution/0100-0199/0100.Same%20Tree/README.md)
-  - [0101.Symmetric Tree](/solution/0100-0199/0101.Symmetric%20Tree/README.md)
-  - [0102.Binary Tree Level Order Traversal](/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README.md)
-  - [0103.Binary Tree Zigzag Level Order Traversal](/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README.md)
-  - [0104.Maximum Depth of Binary Tree](/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README.md)
-  - [0105.Construct Binary Tree from Preorder and Inorder Traversal](/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README.md)
-  - [0106.Construct Binary Tree from Inorder and Postorder Traversal](/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README.md)
-  - [0107.Binary Tree Level Order Traversal II](/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README.md)
-  - [0108.Convert Sorted Array to Binary Search Tree](/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README.md)
-  - [0109.Convert Sorted List to Binary Search Tree](/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README.md)
-  - [0110.Balanced Binary Tree](/solution/0100-0199/0110.Balanced%20Binary%20Tree/README.md)
-  - [0111.Minimum Depth of Binary Tree](/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README.md)
-  - [0112.Path Sum](/solution/0100-0199/0112.Path%20Sum/README.md)
-  - [0113.Path Sum II](/solution/0100-0199/0113.Path%20Sum%20II/README.md)
-  - [0114.Flatten Binary Tree to Linked List](/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README.md)
-  - [0115.Distinct Subsequences](/solution/0100-0199/0115.Distinct%20Subsequences/README.md)
-  - [0116.Populating Next Right Pointers in Each Node](/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README.md)
-  - [0117.Populating Next Right Pointers in Each Node II](/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README.md)
-  - [0118.Pascal's Triangle](/solution/0100-0199/0118.Pascal%27s%20Triangle/README.md)
-  - [0119.Pascal's Triangle II](/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README.md)
-  - [0120.Triangle](/solution/0100-0199/0120.Triangle/README.md)
-  - [0121.Best Time to Buy and Sell Stock](/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README.md)
-  - [0122.Best Time to Buy and Sell Stock II](/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README.md)
-  - [0123.Best Time to Buy and Sell Stock III](/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README.md)
-  - [0124.Binary Tree Maximum Path Sum](/solution/0100-0199/0124.Binary%20Tree%20Maximum%20Path%20Sum/README.md)
-  - [0125.Valid Palindrome](/solution/0100-0199/0125.Valid%20Palindrome/README.md)
-  - [0126.Word Ladder II](/solution/0100-0199/0126.Word%20Ladder%20II/README.md)
-  - [0127.Word Ladder](/solution/0100-0199/0127.Word%20Ladder/README.md)
-  - [0128.Longest Consecutive Sequence](/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README.md)
-  - [0129.Sum Root to Leaf Numbers](/solution/0100-0199/0129.Sum%20Root%20to%20Leaf%20Numbers/README.md)
-  - [0130.Surrounded Regions](/solution/0100-0199/0130.Surrounded%20Regions/README.md)
-  - [0131.Palindrome Partitioning](/solution/0100-0199/0131.Palindrome%20Partitioning/README.md)
-  - [0132.Palindrome Partitioning II](/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README.md)
-  - [0133.Clone Graph](/solution/0100-0199/0133.Clone%20Graph/README.md)
-  - [0134.Gas Station](/solution/0100-0199/0134.Gas%20Station/README.md)
-  - [0135.Candy](/solution/0100-0199/0135.Candy/README.md)
-  - [0136.Single Number](/solution/0100-0199/0136.Single%20Number/README.md)
-  - [0137.Single Number II](/solution/0100-0199/0137.Single%20Number%20II/README.md)
-  - [0138.Copy List with Random Pointer](/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README.md)
-  - [0139.Word Break](/solution/0100-0199/0139.Word%20Break/README.md)
-  - [0140.Word Break II](/solution/0100-0199/0140.Word%20Break%20II/README.md)
-  - [0141.Linked List Cycle](/solution/0100-0199/0141.Linked%20List%20Cycle/README.md)
-  - [0142.Linked List Cycle II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md)
-  - [0143.Reorder List](/solution/0100-0199/0143.Reorder%20List/README.md)
-  - [0144.Binary Tree Preorder Traversal](/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README.md)
-  - [0145.Binary Tree Postorder Traversal](/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README.md)
-  - [0146.Lru Cache](/solution/0100-0199/0146.Lru%20Cache/README.md)
-  - [0147.Insertion Sort List](/solution/0100-0199/0147.Insertion%20Sort%20List/README.md)
-  - [0148.Sort List](/solution/0100-0199/0148.Sort%20List/README.md)
-  - [0149.Max Points on a Line](/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README.md)
-  - [0150.Evaluate Reverse Polish Notation](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README.md)
-  - [0151.Reverse Words in a String](/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README.md)
-  - [0152.Maximum Product Subarray](/solution/0100-0199/0152.Maximum%20Product%20Subarray/README.md)
-  - [0153.Find Minimum in Rotated Sorted Array](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README.md)
-  - [0154.Find Minimum in Rotated Sorted Array II](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README.md)
-  - [0155.Min Stack](/solution/0100-0199/0155.Min%20Stack/README.md)
-  - [0156.Binary Tree Upside Down](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README.md)
-  - [0157.Read N Characters Given Read4](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README.md)
-  - [0158.Read N Characters Given Read4 II - Call multiple times](/solution/0100-0199/0158.Read%20N%20Characters%20Given%20Read4%20II%20-%20Call%20multiple%20times/README.md)
-  - [0159.Longest Substring with At Most Two Distinct Characters](/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README.md)
-  - [0160.Intersection of Two Linked Lists](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README.md)
-  - [0161.One Edit Distance](/solution/0100-0199/0161.One%20Edit%20Distance/README.md)
-  - [0162.Find Peak Element](/solution/0100-0199/0162.Find%20Peak%20Element/README.md)
-  - [0163.Missing Ranges](/solution/0100-0199/0163.Missing%20Ranges/README.md)
-  - [0164.Maximum Gap](/solution/0100-0199/0164.Maximum%20Gap/README.md)
-  - [0165.Compare Version Numbers](/solution/0100-0199/0165.Compare%20Version%20Numbers/README.md)
-  - [0166.Fraction to Recurring Decimal](/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README.md)
-  - [0167.Two Sum II - Input Array Is Sorted](/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted/README.md)
-  - [0168.Excel Sheet Column Title](/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README.md)
-  - [0169.Majority Element](/solution/0100-0199/0169.Majority%20Element/README.md)
-  - [0170.Two Sum III - Data structure design](/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README.md)
-  - [0171.Excel Sheet Column Number](/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README.md)
-  - [0172.Factorial Trailing Zeroes](/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README.md)
-  - [0173.Binary Search Tree Iterator](/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README.md)
-  - [0174.Dungeon Game](/solution/0100-0199/0174.Dungeon%20Game/README.md)
-  - [0175.Combine Two Tables](/solution/0100-0199/0175.Combine%20Two%20Tables/README.md)
-  - [0176.Second Highest Salary](/solution/0100-0199/0176.Second%20Highest%20Salary/README.md)
-  - [0177.Nth Highest Salary](/solution/0100-0199/0177.Nth%20Highest%20Salary/README.md)
-  - [0178.Rank Scores](/solution/0100-0199/0178.Rank%20Scores/README.md)
-  - [0179.Largest Number](/solution/0100-0199/0179.Largest%20Number/README.md)
-  - [0180.Consecutive Numbers](/solution/0100-0199/0180.Consecutive%20Numbers/README.md)
-  - [0181.Employees Earning More Than Their Managers](/solution/0100-0199/0181.Employees%20Earning%20More%20Than%20Their%20Managers/README.md)
-  - [0182.Duplicate Emails](/solution/0100-0199/0182.Duplicate%20Emails/README.md)
-  - [0183.Customers Who Never Order](/solution/0100-0199/0183.Customers%20Who%20Never%20Order/README.md)
-  - [0184.Department Highest Salary](/solution/0100-0199/0184.Department%20Highest%20Salary/README.md)
-  - [0185.Department Top Three Salaries](/solution/0100-0199/0185.Department%20Top%20Three%20Salaries/README.md)
-  - [0186.Reverse Words in a String II](/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README.md)
-  - [0187.Repeated DNA Sequences](/solution/0100-0199/0187.Repeated%20DNA%20Sequences/README.md)
-  - [0188.Best Time to Buy and Sell Stock IV](/solution/0100-0199/0188.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV/README.md)
-  - [0189.Rotate Array](/solution/0100-0199/0189.Rotate%20Array/README.md)
-  - [0190.Reverse Bits](/solution/0100-0199/0190.Reverse%20Bits/README.md)
-  - [0191.Number of 1 Bits](/solution/0100-0199/0191.Number%20of%201%20Bits/README.md)
-  - [0192.Word Frequency](/solution/0100-0199/0192.Word%20Frequency/README.md)
-  - [0193.Valid Phone Numbers](/solution/0100-0199/0193.Valid%20Phone%20Numbers/README.md)
-  - [0194.Transpose File](/solution/0100-0199/0194.Transpose%20File/README.md)
-  - [0195.Tenth Line](/solution/0100-0199/0195.Tenth%20Line/README.md)
-  - [0196.Delete Duplicate Emails](/solution/0100-0199/0196.Delete%20Duplicate%20Emails/README.md)
-  - [0197.Rising Temperature](/solution/0100-0199/0197.Rising%20Temperature/README.md)
-  - [0198.House Robber](/solution/0100-0199/0198.House%20Robber/README.md)
-  - [0199.Binary Tree Right Side View](/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/README.md)
+  - [0100.相同的树](/solution/0100-0199/0100.Same%20Tree/README.md)
+  - [0101.对称二叉树](/solution/0100-0199/0101.Symmetric%20Tree/README.md)
+  - [0102.二叉树的层序遍历](/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README.md)
+  - [0103.二叉树的锯齿形层序遍历](/solution/0100-0199/0103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README.md)
+  - [0104.二叉树的最大深度](/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README.md)
+  - [0105.从前序与中序遍历序列构造二叉树](/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README.md)
+  - [0106.从中序与后序遍历序列构造二叉树](/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README.md)
+  - [0107.二叉树的层序遍历 II](/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README.md)
+  - [0108.将有序数组转换为二叉搜索树](/solution/0100-0199/0108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/README.md)
+  - [0109.有序链表转换二叉搜索树](/solution/0100-0199/0109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree/README.md)
+  - [0110.平衡二叉树](/solution/0100-0199/0110.Balanced%20Binary%20Tree/README.md)
+  - [0111.二叉树的最小深度](/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README.md)
+  - [0112.路径总和](/solution/0100-0199/0112.Path%20Sum/README.md)
+  - [0113.路径总和 II](/solution/0100-0199/0113.Path%20Sum%20II/README.md)
+  - [0114.二叉树展开为链表](/solution/0100-0199/0114.Flatten%20Binary%20Tree%20to%20Linked%20List/README.md)
+  - [0115.不同的子序列](/solution/0100-0199/0115.Distinct%20Subsequences/README.md)
+  - [0116.填充每个节点的下一个右侧节点指针](/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README.md)
+  - [0117.填充每个节点的下一个右侧节点指针 II](/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README.md)
+  - [0118.杨辉三角](/solution/0100-0199/0118.Pascal%27s%20Triangle/README.md)
+  - [0119.杨辉三角 II](/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README.md)
+  - [0120.三角形最小路径和](/solution/0100-0199/0120.Triangle/README.md)
+  - [0121.买卖股票的最佳时机](/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README.md)
+  - [0122.买卖股票的最佳时机 II](/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README.md)
+  - [0123.买卖股票的最佳时机 III](/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README.md)
+  - [0124.二叉树中的最大路径和](/solution/0100-0199/0124.Binary%20Tree%20Maximum%20Path%20Sum/README.md)
+  - [0125.验证回文串](/solution/0100-0199/0125.Valid%20Palindrome/README.md)
+  - [0126.单词接龙 II](/solution/0100-0199/0126.Word%20Ladder%20II/README.md)
+  - [0127.单词接龙](/solution/0100-0199/0127.Word%20Ladder/README.md)
+  - [0128.最长连续序列](/solution/0100-0199/0128.Longest%20Consecutive%20Sequence/README.md)
+  - [0129.求根节点到叶节点数字之和](/solution/0100-0199/0129.Sum%20Root%20to%20Leaf%20Numbers/README.md)
+  - [0130.被围绕的区域](/solution/0100-0199/0130.Surrounded%20Regions/README.md)
+  - [0131.分割回文串](/solution/0100-0199/0131.Palindrome%20Partitioning/README.md)
+  - [0132.分割回文串 II](/solution/0100-0199/0132.Palindrome%20Partitioning%20II/README.md)
+  - [0133.克隆图](/solution/0100-0199/0133.Clone%20Graph/README.md)
+  - [0134.加油站](/solution/0100-0199/0134.Gas%20Station/README.md)
+  - [0135.分发糖果](/solution/0100-0199/0135.Candy/README.md)
+  - [0136.只出现一次的数字](/solution/0100-0199/0136.Single%20Number/README.md)
+  - [0137.只出现一次的数字 II](/solution/0100-0199/0137.Single%20Number%20II/README.md)
+  - [0138.复制带随机指针的链表](/solution/0100-0199/0138.Copy%20List%20with%20Random%20Pointer/README.md)
+  - [0139.单词拆分](/solution/0100-0199/0139.Word%20Break/README.md)
+  - [0140.单词拆分 II](/solution/0100-0199/0140.Word%20Break%20II/README.md)
+  - [0141.环形链表](/solution/0100-0199/0141.Linked%20List%20Cycle/README.md)
+  - [0142.环形链表 II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md)
+  - [0143.重排链表](/solution/0100-0199/0143.Reorder%20List/README.md)
+  - [0144.二叉树的前序遍历](/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README.md)
+  - [0145.二叉树的后序遍历](/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README.md)
+  - [0146.LRU 缓存](/solution/0100-0199/0146.Lru%20Cache/README.md)
+  - [0147.对链表进行插入排序](/solution/0100-0199/0147.Insertion%20Sort%20List/README.md)
+  - [0148.排序链表](/solution/0100-0199/0148.Sort%20List/README.md)
+  - [0149.直线上最多的点数](/solution/0100-0199/0149.Max%20Points%20on%20a%20Line/README.md)
+  - [0150.逆波兰表达式求值](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README.md)
+  - [0151.颠倒字符串中的单词](/solution/0100-0199/0151.Reverse%20Words%20in%20a%20String/README.md)
+  - [0152.乘积最大子数组](/solution/0100-0199/0152.Maximum%20Product%20Subarray/README.md)
+  - [0153.寻找旋转排序数组中的最小值](/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README.md)
+  - [0154.寻找旋转排序数组中的最小值 II](/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README.md)
+  - [0155.最小栈](/solution/0100-0199/0155.Min%20Stack/README.md)
+  - [0156.上下翻转二叉树](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README.md)
+  - [0157.用 Read4 读取 N 个字符](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README.md)
+  - [0158.用 Read4 读取 N 个字符 II](/solution/0100-0199/0158.Read%20N%20Characters%20Given%20Read4%20II%20-%20Call%20multiple%20times/README.md)
+  - [0159.至多包含两个不同字符的最长子串](/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README.md)
+  - [0160.相交链表](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README.md)
+  - [0161.相隔为 1 的编辑距离](/solution/0100-0199/0161.One%20Edit%20Distance/README.md)
+  - [0162.寻找峰值](/solution/0100-0199/0162.Find%20Peak%20Element/README.md)
+  - [0163.缺失的区间](/solution/0100-0199/0163.Missing%20Ranges/README.md)
+  - [0164.最大间距](/solution/0100-0199/0164.Maximum%20Gap/README.md)
+  - [0165.比较版本号](/solution/0100-0199/0165.Compare%20Version%20Numbers/README.md)
+  - [0166.分数到小数](/solution/0100-0199/0166.Fraction%20to%20Recurring%20Decimal/README.md)
+  - [0167.两数之和 II - 输入有序数组](/solution/0100-0199/0167.Two%20Sum%20II%20-%20Input%20Array%20Is%20Sorted/README.md)
+  - [0168.Excel表列名称](/solution/0100-0199/0168.Excel%20Sheet%20Column%20Title/README.md)
+  - [0169.多数元素](/solution/0100-0199/0169.Majority%20Element/README.md)
+  - [0170.两数之和 III - 数据结构设计](/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README.md)
+  - [0171.Excel 表列序号](/solution/0100-0199/0171.Excel%20Sheet%20Column%20Number/README.md)
+  - [0172.阶乘后的零](/solution/0100-0199/0172.Factorial%20Trailing%20Zeroes/README.md)
+  - [0173.二叉搜索树迭代器](/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README.md)
+  - [0174.地下城游戏](/solution/0100-0199/0174.Dungeon%20Game/README.md)
+  - [0175.组合两个表](/solution/0100-0199/0175.Combine%20Two%20Tables/README.md)
+  - [0176.第二高的薪水](/solution/0100-0199/0176.Second%20Highest%20Salary/README.md)
+  - [0177.第N高的薪水](/solution/0100-0199/0177.Nth%20Highest%20Salary/README.md)
+  - [0178.分数排名](/solution/0100-0199/0178.Rank%20Scores/README.md)
+  - [0179.最大数](/solution/0100-0199/0179.Largest%20Number/README.md)
+  - [0180.连续出现的数字](/solution/0100-0199/0180.Consecutive%20Numbers/README.md)
+  - [0181.超过经理收入的员工](/solution/0100-0199/0181.Employees%20Earning%20More%20Than%20Their%20Managers/README.md)
+  - [0182.查找重复的电子邮箱](/solution/0100-0199/0182.Duplicate%20Emails/README.md)
+  - [0183.从不订购的客户](/solution/0100-0199/0183.Customers%20Who%20Never%20Order/README.md)
+  - [0184.部门工资最高的员工](/solution/0100-0199/0184.Department%20Highest%20Salary/README.md)
+  - [0185.部门工资前三高的所有员工](/solution/0100-0199/0185.Department%20Top%20Three%20Salaries/README.md)
+  - [0186.翻转字符串里的单词 II](/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README.md)
+  - [0187.重复的DNA序列](/solution/0100-0199/0187.Repeated%20DNA%20Sequences/README.md)
+  - [0188.买卖股票的最佳时机 IV](/solution/0100-0199/0188.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20IV/README.md)
+  - [0189.轮转数组](/solution/0100-0199/0189.Rotate%20Array/README.md)
+  - [0190.颠倒二进制位](/solution/0100-0199/0190.Reverse%20Bits/README.md)
+  - [0191.位1的个数](/solution/0100-0199/0191.Number%20of%201%20Bits/README.md)
+  - [0192.统计词频](/solution/0100-0199/0192.Word%20Frequency/README.md)
+  - [0193.有效电话号码](/solution/0100-0199/0193.Valid%20Phone%20Numbers/README.md)
+  - [0194.转置文件](/solution/0100-0199/0194.Transpose%20File/README.md)
+  - [0195.第十行](/solution/0100-0199/0195.Tenth%20Line/README.md)
+  - [0196.删除重复的电子邮箱](/solution/0100-0199/0196.Delete%20Duplicate%20Emails/README.md)
+  - [0197.上升的温度](/solution/0100-0199/0197.Rising%20Temperature/README.md)
+  - [0198.打家劫舍](/solution/0100-0199/0198.House%20Robber/README.md)
+  - [0199.二叉树的右视图](/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/README.md)
 
 - 0200-0299
-  - [0200.Number of Islands](/solution/0200-0299/0200.Number%20of%20Islands/README.md)
-  - [0201.Bitwise AND of Numbers Range](/solution/0200-0299/0201.Bitwise%20AND%20of%20Numbers%20Range/README.md)
-  - [0202.Happy Number](/solution/0200-0299/0202.Happy%20Number/README.md)
-  - [0203.Remove Linked List Elements](/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README.md)
-  - [0204.Count Primes](/solution/0200-0299/0204.Count%20Primes/README.md)
-  - [0205.Isomorphic Strings](/solution/0200-0299/0205.Isomorphic%20Strings/README.md)
-  - [0206.Reverse Linked List](/solution/0200-0299/0206.Reverse%20Linked%20List/README.md)
-  - [0207.Course Schedule](/solution/0200-0299/0207.Course%20Schedule/README.md)
-  - [0208.Implement Trie (Prefix Tree)](/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README.md)
-  - [0209.Minimum Size Subarray Sum](/solution/0200-0299/0209.Minimum%20Size%20Subarray%20Sum/README.md)
-  - [0210.Course Schedule II](/solution/0200-0299/0210.Course%20Schedule%20II/README.md)
-  - [0211.Design Add and Search Words Data Structure](/solution/0200-0299/0211.Design%20Add%20and%20Search%20Words%20Data%20Structure/README.md)
-  - [0212.Word Search II](/solution/0200-0299/0212.Word%20Search%20II/README.md)
-  - [0213.House Robber II](/solution/0200-0299/0213.House%20Robber%20II/README.md)
-  - [0214.Shortest Palindrome](/solution/0200-0299/0214.Shortest%20Palindrome/README.md)
-  - [0215.Kth Largest Element in an Array](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README.md)
-  - [0216.Combination Sum III](/solution/0200-0299/0216.Combination%20Sum%20III/README.md)
-  - [0217.Contains Duplicate](/solution/0200-0299/0217.Contains%20Duplicate/README.md)
+  - [0200.岛屿数量](/solution/0200-0299/0200.Number%20of%20Islands/README.md)
+  - [0201.数字范围按位与](/solution/0200-0299/0201.Bitwise%20AND%20of%20Numbers%20Range/README.md)
+  - [0202.快乐数](/solution/0200-0299/0202.Happy%20Number/README.md)
+  - [0203.移除链表元素](/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README.md)
+  - [0204.计数质数](/solution/0200-0299/0204.Count%20Primes/README.md)
+  - [0205.同构字符串](/solution/0200-0299/0205.Isomorphic%20Strings/README.md)
+  - [0206.反转链表](/solution/0200-0299/0206.Reverse%20Linked%20List/README.md)
+  - [0207.课程表](/solution/0200-0299/0207.Course%20Schedule/README.md)
+  - [0208.实现 Trie (前缀树)](/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README.md)
+  - [0209.长度最小的子数组](/solution/0200-0299/0209.Minimum%20Size%20Subarray%20Sum/README.md)
+  - [0210.课程表 II](/solution/0200-0299/0210.Course%20Schedule%20II/README.md)
+  - [0211.添加与搜索单词 - 数据结构设计](/solution/0200-0299/0211.Design%20Add%20and%20Search%20Words%20Data%20Structure/README.md)
+  - [0212.单词搜索 II](/solution/0200-0299/0212.Word%20Search%20II/README.md)
+  - [0213.打家劫舍 II](/solution/0200-0299/0213.House%20Robber%20II/README.md)
+  - [0214.最短回文串](/solution/0200-0299/0214.Shortest%20Palindrome/README.md)
+  - [0215.数组中的第K个最大元素](/solution/0200-0299/0215.Kth%20Largest%20Element%20in%20an%20Array/README.md)
+  - [0216.组合总和 III](/solution/0200-0299/0216.Combination%20Sum%20III/README.md)
+  - [0217.存在重复元素](/solution/0200-0299/0217.Contains%20Duplicate/README.md)
   - [0218.The Skyline Problem](/solution/0200-0299/0218.The%20Skyline%20Problem/README.md)
-  - [0219.Contains Duplicate II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README.md)
-  - [0220.Contains Duplicate III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README.md)
-  - [0221.Maximal Square](/solution/0200-0299/0221.Maximal%20Square/README.md)
-  - [0222.Count Complete Tree Nodes](/solution/0200-0299/0222.Count%20Complete%20Tree%20Nodes/README.md)
-  - [0223.Rectangle Area](/solution/0200-0299/0223.Rectangle%20Area/README.md)
-  - [0224.Basic Calculator](/solution/0200-0299/0224.Basic%20Calculator/README.md)
-  - [0225.Implement Stack using Queues](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README.md)
-  - [0226.Invert Binary Tree](/solution/0200-0299/0226.Invert%20Binary%20Tree/README.md)
-  - [0227.Basic Calculator II](/solution/0200-0299/0227.Basic%20Calculator%20II/README.md)
-  - [0228.Summary Ranges](/solution/0200-0299/0228.Summary%20Ranges/README.md)
-  - [0229.Majority Element II](/solution/0200-0299/0229.Majority%20Element%20II/README.md)
-  - [0230.Kth Smallest Element in a BST](/solution/0200-0299/0230.Kth%20Smallest%20Element%20in%20a%20BST/README.md)
-  - [0231.Power of Two](/solution/0200-0299/0231.Power%20of%20Two/README.md)
-  - [0232.Implement Queue using Stacks](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README.md)
-  - [0233.Number of Digit One](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
-  - [0234.Palindrome Linked List](/solution/0200-0299/0234.Palindrome%20Linked%20List/README.md)
-  - [0235.Lowest Common Ancestor of a Binary Search Tree](/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README.md)
-  - [0236.Lowest Common Ancestor of a Binary Tree](/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README.md)
-  - [0237.Delete Node in a Linked List](/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README.md)
-  - [0238.Product of Array Except Self](/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README.md)
-  - [0239.Sliding Window Maximum](/solution/0200-0299/0239.Sliding%20Window%20Maximum/README.md)
-  - [0240.Search a 2D Matrix II](/solution/0200-0299/0240.Search%20a%202D%20Matrix%20II/README.md)
-  - [0241.Different Ways to Add Parentheses](/solution/0200-0299/0241.Different%20Ways%20to%20Add%20Parentheses/README.md)
-  - [0242.Valid Anagram](/solution/0200-0299/0242.Valid%20Anagram/README.md)
-  - [0243.Shortest Word Distance](/solution/0200-0299/0243.Shortest%20Word%20Distance/README.md)
-  - [0244.Shortest Word Distance II](/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README.md)
-  - [0245.Shortest Word Distance III](/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README.md)
-  - [0246.Strobogrammatic Number](/solution/0200-0299/0246.Strobogrammatic%20Number/README.md)
-  - [0247.Strobogrammatic Number II](/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README.md)
-  - [0248.Strobogrammatic Number III](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md)
-  - [0249.Group Shifted Strings](/solution/0200-0299/0249.Group%20Shifted%20Strings/README.md)
-  - [0250.Count Univalue Subtrees](/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README.md)
-  - [0251.Flatten 2D Vector](/solution/0200-0299/0251.Flatten%202D%20Vector/README.md)
-  - [0252.Meeting Rooms](/solution/0200-0299/0252.Meeting%20Rooms/README.md)
-  - [0253.Meeting Rooms II](/solution/0200-0299/0253.Meeting%20Rooms%20II/README.md)
-  - [0254.Factor Combinations](/solution/0200-0299/0254.Factor%20Combinations/README.md)
-  - [0255.Verify Preorder Sequence in Binary Search Tree](/solution/0200-0299/0255.Verify%20Preorder%20Sequence%20in%20Binary%20Search%20Tree/README.md)
-  - [0256.Paint House](/solution/0200-0299/0256.Paint%20House/README.md)
-  - [0257.Binary Tree Paths](/solution/0200-0299/0257.Binary%20Tree%20Paths/README.md)
-  - [0258.Add Digits](/solution/0200-0299/0258.Add%20Digits/README.md)
-  - [0259.3Sum Smaller](/solution/0200-0299/0259.3Sum%20Smaller/README.md)
-  - [0260.Single Number III](/solution/0200-0299/0260.Single%20Number%20III/README.md)
-  - [0261.Graph Valid Tree](/solution/0200-0299/0261.Graph%20Valid%20Tree/README.md)
-  - [0262.Trips and Users](/solution/0200-0299/0262.Trips%20and%20Users/README.md)
-  - [0263.Ugly Number](/solution/0200-0299/0263.Ugly%20Number/README.md)
-  - [0264.Ugly Number II](/solution/0200-0299/0264.Ugly%20Number%20II/README.md)
-  - [0265.Paint House II](/solution/0200-0299/0265.Paint%20House%20II/README.md)
-  - [0266.Palindrome Permutation](/solution/0200-0299/0266.Palindrome%20Permutation/README.md)
-  - [0267.Palindrome Permutation II](/solution/0200-0299/0267.Palindrome%20Permutation%20II/README.md)
-  - [0268.Missing Number](/solution/0200-0299/0268.Missing%20Number/README.md)
-  - [0269.Alien Dictionary](/solution/0200-0299/0269.Alien%20Dictionary/README.md)
-  - [0270.Closest Binary Search Tree Value](/solution/0200-0299/0270.Closest%20Binary%20Search%20Tree%20Value/README.md)
-  - [0271.Encode and Decode Strings](/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README.md)
-  - [0272.Closest Binary Search Tree Value II](/solution/0200-0299/0272.Closest%20Binary%20Search%20Tree%20Value%20II/README.md)
-  - [0273.Integer to English Words](/solution/0200-0299/0273.Integer%20to%20English%20Words/README.md)
-  - [0274.H-Index](/solution/0200-0299/0274.H-Index/README.md)
-  - [0275.H-Index II](/solution/0200-0299/0275.H-Index%20II/README.md)
-  - [0276.Paint Fence](/solution/0200-0299/0276.Paint%20Fence/README.md)
-  - [0277.Find the Celebrity](/solution/0200-0299/0277.Find%20the%20Celebrity/README.md)
-  - [0278.First Bad Version](/solution/0200-0299/0278.First%20Bad%20Version/README.md)
-  - [0279.Perfect Squares](/solution/0200-0299/0279.Perfect%20Squares/README.md)
-  - [0280.Wiggle Sort](/solution/0200-0299/0280.Wiggle%20Sort/README.md)
-  - [0281.Zigzag Iterator](/solution/0200-0299/0281.Zigzag%20Iterator/README.md)
-  - [0282.Expression Add Operators](/solution/0200-0299/0282.Expression%20Add%20Operators/README.md)
-  - [0283.Move Zeroes](/solution/0200-0299/0283.Move%20Zeroes/README.md)
-  - [0284.Peeking Iterator](/solution/0200-0299/0284.Peeking%20Iterator/README.md)
-  - [0285.Inorder Successor in BST](/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README.md)
-  - [0286.Walls and Gates](/solution/0200-0299/0286.Walls%20and%20Gates/README.md)
-  - [0287.Find the Duplicate Number](/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README.md)
-  - [0288.Unique Word Abbreviation](/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README.md)
-  - [0289.Game of Life](/solution/0200-0299/0289.Game%20of%20Life/README.md)
-  - [0290.Word Pattern](/solution/0200-0299/0290.Word%20Pattern/README.md)
-  - [0291.Word Pattern II](/solution/0200-0299/0291.Word%20Pattern%20II/README.md)
-  - [0292.Nim Game](/solution/0200-0299/0292.Nim%20Game/README.md)
-  - [0293.Flip Game](/solution/0200-0299/0293.Flip%20Game/README.md)
-  - [0294.Flip Game II](/solution/0200-0299/0294.Flip%20Game%20II/README.md)
-  - [0295.Find Median from Data Stream](/solution/0200-0299/0295.Find%20Median%20from%20Data%20Stream/README.md)
-  - [0296.Best Meeting Point](/solution/0200-0299/0296.Best%20Meeting%20Point/README.md)
-  - [0297.Serialize and Deserialize Binary Tree](/solution/0200-0299/0297.Serialize%20and%20Deserialize%20Binary%20Tree/README.md)
-  - [0298.Binary Tree Longest Consecutive Sequence](/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README.md)
-  - [0299.Bulls and Cows](/solution/0200-0299/0299.Bulls%20and%20Cows/README.md)
+  - [0219.存在重复元素 II](/solution/0200-0299/0219.Contains%20Duplicate%20II/README.md)
+  - [0220.存在重复元素 III](/solution/0200-0299/0220.Contains%20Duplicate%20III/README.md)
+  - [0221.最大正方形](/solution/0200-0299/0221.Maximal%20Square/README.md)
+  - [0222.完全二叉树的节点个数](/solution/0200-0299/0222.Count%20Complete%20Tree%20Nodes/README.md)
+  - [0223.矩形面积](/solution/0200-0299/0223.Rectangle%20Area/README.md)
+  - [0224.基本计算器](/solution/0200-0299/0224.Basic%20Calculator/README.md)
+  - [0225.用队列实现栈](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README.md)
+  - [0226.翻转二叉树](/solution/0200-0299/0226.Invert%20Binary%20Tree/README.md)
+  - [0227.基本计算器 II](/solution/0200-0299/0227.Basic%20Calculator%20II/README.md)
+  - [0228.汇总区间](/solution/0200-0299/0228.Summary%20Ranges/README.md)
+  - [0229.求众数 II](/solution/0200-0299/0229.Majority%20Element%20II/README.md)
+  - [0230.二叉搜索树中第K小的元素](/solution/0200-0299/0230.Kth%20Smallest%20Element%20in%20a%20BST/README.md)
+  - [0231.2 的幂](/solution/0200-0299/0231.Power%20of%20Two/README.md)
+  - [0232.用栈实现队列](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README.md)
+  - [0233.数字 1 的个数](/solution/0200-0299/0233.Number%20of%20Digit%20One/README.md)
+  - [0234.回文链表](/solution/0200-0299/0234.Palindrome%20Linked%20List/README.md)
+  - [0235.二叉搜索树的最近公共祖先](/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README.md)
+  - [0236.二叉树的最近公共祖先](/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README.md)
+  - [0237.删除链表中的节点](/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README.md)
+  - [0238.除自身以外数组的乘积](/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README.md)
+  - [0239.滑动窗口最大值](/solution/0200-0299/0239.Sliding%20Window%20Maximum/README.md)
+  - [0240.搜索二维矩阵 II](/solution/0200-0299/0240.Search%20a%202D%20Matrix%20II/README.md)
+  - [0241.为运算表达式设计优先级](/solution/0200-0299/0241.Different%20Ways%20to%20Add%20Parentheses/README.md)
+  - [0242.有效的字母异位词](/solution/0200-0299/0242.Valid%20Anagram/README.md)
+  - [0243.最短单词距离](/solution/0200-0299/0243.Shortest%20Word%20Distance/README.md)
+  - [0244.最短单词距离 II](/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README.md)
+  - [0245.最短单词距离 III](/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README.md)
+  - [0246.中心对称数](/solution/0200-0299/0246.Strobogrammatic%20Number/README.md)
+  - [0247.中心对称数 II](/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README.md)
+  - [0248.中心对称数 III](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md)
+  - [0249.移位字符串分组](/solution/0200-0299/0249.Group%20Shifted%20Strings/README.md)
+  - [0250.统计同值子树](/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README.md)
+  - [0251.展开二维向量](/solution/0200-0299/0251.Flatten%202D%20Vector/README.md)
+  - [0252.会议室](/solution/0200-0299/0252.Meeting%20Rooms/README.md)
+  - [0253.会议室 II](/solution/0200-0299/0253.Meeting%20Rooms%20II/README.md)
+  - [0254.因子的组合](/solution/0200-0299/0254.Factor%20Combinations/README.md)
+  - [0255.验证前序遍历序列二叉搜索树](/solution/0200-0299/0255.Verify%20Preorder%20Sequence%20in%20Binary%20Search%20Tree/README.md)
+  - [0256.粉刷房子](/solution/0200-0299/0256.Paint%20House/README.md)
+  - [0257.二叉树的所有路径](/solution/0200-0299/0257.Binary%20Tree%20Paths/README.md)
+  - [0258.各位相加](/solution/0200-0299/0258.Add%20Digits/README.md)
+  - [0259.较小的三数之和](/solution/0200-0299/0259.3Sum%20Smaller/README.md)
+  - [0260.只出现一次的数字 III](/solution/0200-0299/0260.Single%20Number%20III/README.md)
+  - [0261.以图判树](/solution/0200-0299/0261.Graph%20Valid%20Tree/README.md)
+  - [0262.行程和用户](/solution/0200-0299/0262.Trips%20and%20Users/README.md)
+  - [0263.丑数](/solution/0200-0299/0263.Ugly%20Number/README.md)
+  - [0264.丑数 II](/solution/0200-0299/0264.Ugly%20Number%20II/README.md)
+  - [0265.粉刷房子 II](/solution/0200-0299/0265.Paint%20House%20II/README.md)
+  - [0266.回文排列](/solution/0200-0299/0266.Palindrome%20Permutation/README.md)
+  - [0267.回文排列 II](/solution/0200-0299/0267.Palindrome%20Permutation%20II/README.md)
+  - [0268.丢失的数字](/solution/0200-0299/0268.Missing%20Number/README.md)
+  - [0269.火星词典](/solution/0200-0299/0269.Alien%20Dictionary/README.md)
+  - [0270.最接近的二叉搜索树值](/solution/0200-0299/0270.Closest%20Binary%20Search%20Tree%20Value/README.md)
+  - [0271.字符串的编码与解码](/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README.md)
+  - [0272.最接近的二叉搜索树值 II](/solution/0200-0299/0272.Closest%20Binary%20Search%20Tree%20Value%20II/README.md)
+  - [0273.整数转换英文表示](/solution/0200-0299/0273.Integer%20to%20English%20Words/README.md)
+  - [0274.H 指数](/solution/0200-0299/0274.H-Index/README.md)
+  - [0275.H 指数 II](/solution/0200-0299/0275.H-Index%20II/README.md)
+  - [0276.栅栏涂色](/solution/0200-0299/0276.Paint%20Fence/README.md)
+  - [0277.搜寻名人](/solution/0200-0299/0277.Find%20the%20Celebrity/README.md)
+  - [0278.第一个错误的版本](/solution/0200-0299/0278.First%20Bad%20Version/README.md)
+  - [0279.完全平方数](/solution/0200-0299/0279.Perfect%20Squares/README.md)
+  - [0280.摆动排序](/solution/0200-0299/0280.Wiggle%20Sort/README.md)
+  - [0281.锯齿迭代器](/solution/0200-0299/0281.Zigzag%20Iterator/README.md)
+  - [0282.给表达式添加运算符](/solution/0200-0299/0282.Expression%20Add%20Operators/README.md)
+  - [0283.移动零](/solution/0200-0299/0283.Move%20Zeroes/README.md)
+  - [0284.顶端迭代器](/solution/0200-0299/0284.Peeking%20Iterator/README.md)
+  - [0285.二叉搜索树中的中序后继](/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README.md)
+  - [0286.墙与门](/solution/0200-0299/0286.Walls%20and%20Gates/README.md)
+  - [0287.寻找重复数](/solution/0200-0299/0287.Find%20the%20Duplicate%20Number/README.md)
+  - [0288.单词的唯一缩写](/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README.md)
+  - [0289.生命游戏](/solution/0200-0299/0289.Game%20of%20Life/README.md)
+  - [0290.单词规律](/solution/0200-0299/0290.Word%20Pattern/README.md)
+  - [0291.单词规律 II](/solution/0200-0299/0291.Word%20Pattern%20II/README.md)
+  - [0292.Nim 游戏](/solution/0200-0299/0292.Nim%20Game/README.md)
+  - [0293.翻转游戏](/solution/0200-0299/0293.Flip%20Game/README.md)
+  - [0294.翻转游戏 II](/solution/0200-0299/0294.Flip%20Game%20II/README.md)
+  - [0295.数据流的中位数](/solution/0200-0299/0295.Find%20Median%20from%20Data%20Stream/README.md)
+  - [0296.最佳的碰头地点](/solution/0200-0299/0296.Best%20Meeting%20Point/README.md)
+  - [0297.二叉树的序列化与反序列化](/solution/0200-0299/0297.Serialize%20and%20Deserialize%20Binary%20Tree/README.md)
+  - [0298.二叉树最长连续序列](/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README.md)
+  - [0299.猜数字游戏](/solution/0200-0299/0299.Bulls%20and%20Cows/README.md)
 
 - 0300-0399
-  - [0300.Longest Increasing Subsequence](/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README.md)
-  - [0301.Remove Invalid Parentheses](/solution/0300-0399/0301.Remove%20Invalid%20Parentheses/README.md)
-  - [0302.Smallest Rectangle Enclosing Black Pixels](/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README.md)
-  - [0303.Range Sum Query - Immutable](/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README.md)
-  - [0304.Range Sum Query 2D - Immutable](/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README.md)
-  - [0305.Number of Islands II](/solution/0300-0399/0305.Number%20of%20Islands%20II/README.md)
-  - [0306.Additive Number](/solution/0300-0399/0306.Additive%20Number/README.md)
-  - [0307.Range Sum Query - Mutable](/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README.md)
-  - [0308.Range Sum Query 2D - Mutable](/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README.md)
-  - [0309.Best Time to Buy and Sell Stock with Cooldown](/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README.md)
-  - [0310.Minimum Height Trees](/solution/0300-0399/0310.Minimum%20Height%20Trees/README.md)
-  - [0311.Sparse Matrix Multiplication](/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README.md)
-  - [0312.Burst Balloons](/solution/0300-0399/0312.Burst%20Balloons/README.md)
-  - [0313.Super Ugly Number](/solution/0300-0399/0313.Super%20Ugly%20Number/README.md)
-  - [0314.Binary Tree Vertical Order Traversal](/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README.md)
-  - [0315.Count of Smaller Numbers After Self](/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README.md)
-  - [0316.Remove Duplicate Letters](/solution/0300-0399/0316.Remove%20Duplicate%20Letters/README.md)
-  - [0317.Shortest Distance from All Buildings](/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README.md)
-  - [0318.Maximum Product of Word Lengths](/solution/0300-0399/0318.Maximum%20Product%20of%20Word%20Lengths/README.md)
-  - [0319.Bulb Switcher](/solution/0300-0399/0319.Bulb%20Switcher/README.md)
-  - [0320.Generalized Abbreviation](/solution/0300-0399/0320.Generalized%20Abbreviation/README.md)
-  - [0321.Create Maximum Number](/solution/0300-0399/0321.Create%20Maximum%20Number/README.md)
-  - [0322.Coin Change](/solution/0300-0399/0322.Coin%20Change/README.md)
-  - [0323.Number of Connected Components in an Undirected Graph](/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/README.md)
-  - [0324.Wiggle Sort II](/solution/0300-0399/0324.Wiggle%20Sort%20II/README.md)
-  - [0325.Maximum Size Subarray Sum Equals k](/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README.md)
-  - [0326.Power of Three](/solution/0300-0399/0326.Power%20of%20Three/README.md)
-  - [0327.Count of Range Sum](/solution/0300-0399/0327.Count%20of%20Range%20Sum/README.md)
-  - [0328.Odd Even Linked List](/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README.md)
-  - [0329.Longest Increasing Path in a Matrix](/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README.md)
-  - [0330.Patching Array](/solution/0300-0399/0330.Patching%20Array/README.md)
-  - [0331.Verify Preorder Serialization of a Binary Tree](/solution/0300-0399/0331.Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/README.md)
-  - [0332.Reconstruct Itinerary](/solution/0300-0399/0332.Reconstruct%20Itinerary/README.md)
-  - [0333.Largest BST Subtree](/solution/0300-0399/0333.Largest%20BST%20Subtree/README.md)
-  - [0334.Increasing Triplet Subsequence](/solution/0300-0399/0334.Increasing%20Triplet%20Subsequence/README.md)
-  - [0335.Self Crossing](/solution/0300-0399/0335.Self%20Crossing/README.md)
-  - [0336.Palindrome Pairs](/solution/0300-0399/0336.Palindrome%20Pairs/README.md)
-  - [0337.House Robber III](/solution/0300-0399/0337.House%20Robber%20III/README.md)
-  - [0338.Counting Bits](/solution/0300-0399/0338.Counting%20Bits/README.md)
-  - [0339.Nested List Weight Sum](/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README.md)
-  - [0340.Longest Substring with At Most K Distinct Characters](/solution/0300-0399/0340.Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters/README.md)
-  - [0341.Flatten Nested List Iterator](/solution/0300-0399/0341.Flatten%20Nested%20List%20Iterator/README.md)
-  - [0342.Power of Four](/solution/0300-0399/0342.Power%20of%20Four/README.md)
-  - [0343.Integer Break](/solution/0300-0399/0343.Integer%20Break/README.md)
-  - [0344.Reverse String](/solution/0300-0399/0344.Reverse%20String/README.md)
-  - [0345.Reverse Vowels of a String](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README.md)
-  - [0346.Moving Average from Data Stream](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README.md)
-  - [0347.Top K Frequent Elements](/solution/0300-0399/0347.Top%20K%20Frequent%20Elements/README.md)
-  - [0348.Design Tic-Tac-Toe](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README.md)
-  - [0349.Intersection of Two Arrays](/solution/0300-0399/0349.Intersection%20of%20Two%20Arrays/README.md)
-  - [0350.Intersection of Two Arrays II](/solution/0300-0399/0350.Intersection%20of%20Two%20Arrays%20II/README.md)
-  - [0351.Android Unlock Patterns](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README.md)
-  - [0352.Data Stream as Disjoint Intervals](/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README.md)
-  - [0353.Design Snake Game](/solution/0300-0399/0353.Design%20Snake%20Game/README.md)
-  - [0354.Russian Doll Envelopes](/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README.md)
-  - [0355.Design Twitter](/solution/0300-0399/0355.Design%20Twitter/README.md)
-  - [0356.Line Reflection](/solution/0300-0399/0356.Line%20Reflection/README.md)
-  - [0357.Count Numbers with Unique Digits](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
-  - [0358.Rearrange String k Distance Apart](/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README.md)
-  - [0359.Logger Rate Limiter](/solution/0300-0399/0359.Logger%20Rate%20Limiter/README.md)
-  - [0360.Sort Transformed Array](/solution/0300-0399/0360.Sort%20Transformed%20Array/README.md)
-  - [0361.Bomb Enemy](/solution/0300-0399/0361.Bomb%20Enemy/README.md)
-  - [0362.Design Hit Counter](/solution/0300-0399/0362.Design%20Hit%20Counter/README.md)
-  - [0363.Max Sum of Rectangle No Larger Than K](/solution/0300-0399/0363.Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/README.md)
-  - [0364.Nested List Weight Sum II](/solution/0300-0399/0364.Nested%20List%20Weight%20Sum%20II/README.md)
-  - [0365.Water and Jug Problem](/solution/0300-0399/0365.Water%20and%20Jug%20Problem/README.md)
-  - [0366.Find Leaves of Binary Tree](/solution/0300-0399/0366.Find%20Leaves%20of%20Binary%20Tree/README.md)
-  - [0367.Valid Perfect Square](/solution/0300-0399/0367.Valid%20Perfect%20Square/README.md)
-  - [0368.Largest Divisible Subset](/solution/0300-0399/0368.Largest%20Divisible%20Subset/README.md)
-  - [0369.Plus One Linked List](/solution/0300-0399/0369.Plus%20One%20Linked%20List/README.md)
-  - [0370.Range Addition](/solution/0300-0399/0370.Range%20Addition/README.md)
-  - [0371.Sum of Two Integers](/solution/0300-0399/0371.Sum%20of%20Two%20Integers/README.md)
-  - [0372.Super Pow](/solution/0300-0399/0372.Super%20Pow/README.md)
-  - [0373.Find K Pairs with Smallest Sums](/solution/0300-0399/0373.Find%20K%20Pairs%20with%20Smallest%20Sums/README.md)
-  - [0374.Guess Number Higher or Lower](/solution/0300-0399/0374.Guess%20Number%20Higher%20or%20Lower/README.md)
-  - [0375.Guess Number Higher or Lower II](/solution/0300-0399/0375.Guess%20Number%20Higher%20or%20Lower%20II/README.md)
-  - [0376.Wiggle Subsequence](/solution/0300-0399/0376.Wiggle%20Subsequence/README.md)
-  - [0377.Combination Sum IV](/solution/0300-0399/0377.Combination%20Sum%20IV/README.md)
-  - [0378.Kth Smallest Element in a Sorted Matrix](/solution/0300-0399/0378.Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix/README.md)
-  - [0379.Design Phone Directory](/solution/0300-0399/0379.Design%20Phone%20Directory/README.md)
-  - [0380.Insert Delete GetRandom O(1)](/solution/0300-0399/0380.Insert%20Delete%20GetRandom%20O%281%29/README.md)
-  - [0381.Insert Delete GetRandom O(1) - Duplicates allowed](/solution/0300-0399/0381.Insert%20Delete%20GetRandom%20O%281%29%20-%20Duplicates%20allowed/README.md)
-  - [0382.Linked List Random Node](/solution/0300-0399/0382.Linked%20List%20Random%20Node/README.md)
-  - [0383.Ransom Note](/solution/0300-0399/0383.Ransom%20Note/README.md)
-  - [0384.Shuffle an Array](/solution/0300-0399/0384.Shuffle%20an%20Array/README.md)
-  - [0385.Mini Parser](/solution/0300-0399/0385.Mini%20Parser/README.md)
-  - [0386.Lexicographical Numbers](/solution/0300-0399/0386.Lexicographical%20Numbers/README.md)
-  - [0387.First Unique Character in a String](/solution/0300-0399/0387.First%20Unique%20Character%20in%20a%20String/README.md)
-  - [0388.Longest Absolute File Path](/solution/0300-0399/0388.Longest%20Absolute%20File%20Path/README.md)
-  - [0389.Find the Difference](/solution/0300-0399/0389.Find%20the%20Difference/README.md)
-  - [0390.Elimination Game](/solution/0300-0399/0390.Elimination%20Game/README.md)
-  - [0391.Perfect Rectangle](/solution/0300-0399/0391.Perfect%20Rectangle/README.md)
-  - [0392.Is Subsequence](/solution/0300-0399/0392.Is%20Subsequence/README.md)
-  - [0393.UTF-8 Validation](/solution/0300-0399/0393.UTF-8%20Validation/README.md)
-  - [0394.Decode String](/solution/0300-0399/0394.Decode%20String/README.md)
-  - [0395.Longest Substring with At Least K Repeating Characters](/solution/0300-0399/0395.Longest%20Substring%20with%20At%20Least%20K%20Repeating%20Characters/README.md)
-  - [0396.Rotate Function](/solution/0300-0399/0396.Rotate%20Function/README.md)
-  - [0397.Integer Replacement](/solution/0300-0399/0397.Integer%20Replacement/README.md)
-  - [0398.Random Pick Index](/solution/0300-0399/0398.Random%20Pick%20Index/README.md)
-  - [0399.Evaluate Division](/solution/0300-0399/0399.Evaluate%20Division/README.md)
+  - [0300.最长递增子序列](/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README.md)
+  - [0301.删除无效的括号](/solution/0300-0399/0301.Remove%20Invalid%20Parentheses/README.md)
+  - [0302.包含全部黑色像素的最小矩形](/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README.md)
+  - [0303.区域和检索 - 数组不可变](/solution/0300-0399/0303.Range%20Sum%20Query%20-%20Immutable/README.md)
+  - [0304.二维区域和检索 - 矩阵不可变](/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README.md)
+  - [0305.岛屿数量 II](/solution/0300-0399/0305.Number%20of%20Islands%20II/README.md)
+  - [0306.累加数](/solution/0300-0399/0306.Additive%20Number/README.md)
+  - [0307.区域和检索 - 数组可修改](/solution/0300-0399/0307.Range%20Sum%20Query%20-%20Mutable/README.md)
+  - [0308.二维区域和检索 - 可变](/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README.md)
+  - [0309.最佳买卖股票时机含冷冻期](/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README.md)
+  - [0310.最小高度树](/solution/0300-0399/0310.Minimum%20Height%20Trees/README.md)
+  - [0311.稀疏矩阵的乘法](/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README.md)
+  - [0312.戳气球](/solution/0300-0399/0312.Burst%20Balloons/README.md)
+  - [0313.超级丑数](/solution/0300-0399/0313.Super%20Ugly%20Number/README.md)
+  - [0314.二叉树的垂直遍历](/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README.md)
+  - [0315.计算右侧小于当前元素的个数](/solution/0300-0399/0315.Count%20of%20Smaller%20Numbers%20After%20Self/README.md)
+  - [0316.去除重复字母](/solution/0300-0399/0316.Remove%20Duplicate%20Letters/README.md)
+  - [0317.离建筑物最近的距离](/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README.md)
+  - [0318.最大单词长度乘积](/solution/0300-0399/0318.Maximum%20Product%20of%20Word%20Lengths/README.md)
+  - [0319.灯泡开关](/solution/0300-0399/0319.Bulb%20Switcher/README.md)
+  - [0320.列举单词的全部缩写](/solution/0300-0399/0320.Generalized%20Abbreviation/README.md)
+  - [0321.拼接最大数](/solution/0300-0399/0321.Create%20Maximum%20Number/README.md)
+  - [0322.零钱兑换](/solution/0300-0399/0322.Coin%20Change/README.md)
+  - [0323.无向图中连通分量的数目](/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/README.md)
+  - [0324.摆动排序 II](/solution/0300-0399/0324.Wiggle%20Sort%20II/README.md)
+  - [0325.和等于 k 的最长子数组长度](/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README.md)
+  - [0326.3 的幂](/solution/0300-0399/0326.Power%20of%20Three/README.md)
+  - [0327.区间和的个数](/solution/0300-0399/0327.Count%20of%20Range%20Sum/README.md)
+  - [0328.奇偶链表](/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README.md)
+  - [0329.矩阵中的最长递增路径](/solution/0300-0399/0329.Longest%20Increasing%20Path%20in%20a%20Matrix/README.md)
+  - [0330.按要求补齐数组](/solution/0300-0399/0330.Patching%20Array/README.md)
+  - [0331.验证二叉树的前序序列化](/solution/0300-0399/0331.Verify%20Preorder%20Serialization%20of%20a%20Binary%20Tree/README.md)
+  - [0332.重新安排行程](/solution/0300-0399/0332.Reconstruct%20Itinerary/README.md)
+  - [0333.最大 BST 子树](/solution/0300-0399/0333.Largest%20BST%20Subtree/README.md)
+  - [0334.递增的三元子序列](/solution/0300-0399/0334.Increasing%20Triplet%20Subsequence/README.md)
+  - [0335.路径交叉](/solution/0300-0399/0335.Self%20Crossing/README.md)
+  - [0336.回文对](/solution/0300-0399/0336.Palindrome%20Pairs/README.md)
+  - [0337.打家劫舍 III](/solution/0300-0399/0337.House%20Robber%20III/README.md)
+  - [0338.比特位计数](/solution/0300-0399/0338.Counting%20Bits/README.md)
+  - [0339.嵌套列表权重和](/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README.md)
+  - [0340.至多包含 K 个不同字符的最长子串](/solution/0300-0399/0340.Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters/README.md)
+  - [0341.扁平化嵌套列表迭代器](/solution/0300-0399/0341.Flatten%20Nested%20List%20Iterator/README.md)
+  - [0342.4的幂](/solution/0300-0399/0342.Power%20of%20Four/README.md)
+  - [0343.整数拆分](/solution/0300-0399/0343.Integer%20Break/README.md)
+  - [0344.反转字符串](/solution/0300-0399/0344.Reverse%20String/README.md)
+  - [0345.反转字符串中的元音字母](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README.md)
+  - [0346.数据流中的移动平均值](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README.md)
+  - [0347.前 K 个高频元素](/solution/0300-0399/0347.Top%20K%20Frequent%20Elements/README.md)
+  - [0348.设计井字棋](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README.md)
+  - [0349.两个数组的交集](/solution/0300-0399/0349.Intersection%20of%20Two%20Arrays/README.md)
+  - [0350.两个数组的交集 II](/solution/0300-0399/0350.Intersection%20of%20Two%20Arrays%20II/README.md)
+  - [0351.安卓系统手势解锁](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README.md)
+  - [0352.将数据流变为多个不相交区间](/solution/0300-0399/0352.Data%20Stream%20as%20Disjoint%20Intervals/README.md)
+  - [0353.贪吃蛇](/solution/0300-0399/0353.Design%20Snake%20Game/README.md)
+  - [0354.俄罗斯套娃信封问题](/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README.md)
+  - [0355.设计推特](/solution/0300-0399/0355.Design%20Twitter/README.md)
+  - [0356.直线镜像](/solution/0300-0399/0356.Line%20Reflection/README.md)
+  - [0357.统计各位数字都不同的数字个数](/solution/0300-0399/0357.Count%20Numbers%20with%20Unique%20Digits/README.md)
+  - [0358.K 距离间隔重排字符串](/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README.md)
+  - [0359.日志速率限制器](/solution/0300-0399/0359.Logger%20Rate%20Limiter/README.md)
+  - [0360.有序转化数组](/solution/0300-0399/0360.Sort%20Transformed%20Array/README.md)
+  - [0361.轰炸敌人](/solution/0300-0399/0361.Bomb%20Enemy/README.md)
+  - [0362.敲击计数器](/solution/0300-0399/0362.Design%20Hit%20Counter/README.md)
+  - [0363.矩形区域不超过 K 的最大数值和](/solution/0300-0399/0363.Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/README.md)
+  - [0364.加权嵌套序列和 II](/solution/0300-0399/0364.Nested%20List%20Weight%20Sum%20II/README.md)
+  - [0365.水壶问题](/solution/0300-0399/0365.Water%20and%20Jug%20Problem/README.md)
+  - [0366.寻找二叉树的叶子节点](/solution/0300-0399/0366.Find%20Leaves%20of%20Binary%20Tree/README.md)
+  - [0367.有效的完全平方数](/solution/0300-0399/0367.Valid%20Perfect%20Square/README.md)
+  - [0368.最大整除子集](/solution/0300-0399/0368.Largest%20Divisible%20Subset/README.md)
+  - [0369.给单链表加一](/solution/0300-0399/0369.Plus%20One%20Linked%20List/README.md)
+  - [0370.区间加法](/solution/0300-0399/0370.Range%20Addition/README.md)
+  - [0371.两整数之和](/solution/0300-0399/0371.Sum%20of%20Two%20Integers/README.md)
+  - [0372.超级次方](/solution/0300-0399/0372.Super%20Pow/README.md)
+  - [0373.查找和最小的 K 对数字](/solution/0300-0399/0373.Find%20K%20Pairs%20with%20Smallest%20Sums/README.md)
+  - [0374.猜数字大小](/solution/0300-0399/0374.Guess%20Number%20Higher%20or%20Lower/README.md)
+  - [0375.猜数字大小 II](/solution/0300-0399/0375.Guess%20Number%20Higher%20or%20Lower%20II/README.md)
+  - [0376.摆动序列](/solution/0300-0399/0376.Wiggle%20Subsequence/README.md)
+  - [0377.组合总和 Ⅳ](/solution/0300-0399/0377.Combination%20Sum%20IV/README.md)
+  - [0378.有序矩阵中第 K 小的元素](/solution/0300-0399/0378.Kth%20Smallest%20Element%20in%20a%20Sorted%20Matrix/README.md)
+  - [0379.电话目录管理系统](/solution/0300-0399/0379.Design%20Phone%20Directory/README.md)
+  - [0380.O(1) 时间插入、删除和获取随机元素](/solution/0300-0399/0380.Insert%20Delete%20GetRandom%20O%281%29/README.md)
+  - [0381.O(1) 时间插入、删除和获取随机元素 - 允许重复](/solution/0300-0399/0381.Insert%20Delete%20GetRandom%20O%281%29%20-%20Duplicates%20allowed/README.md)
+  - [0382.链表随机节点](/solution/0300-0399/0382.Linked%20List%20Random%20Node/README.md)
+  - [0383.赎金信](/solution/0300-0399/0383.Ransom%20Note/README.md)
+  - [0384.打乱数组](/solution/0300-0399/0384.Shuffle%20an%20Array/README.md)
+  - [0385.迷你语法分析器](/solution/0300-0399/0385.Mini%20Parser/README.md)
+  - [0386.字典序排数](/solution/0300-0399/0386.Lexicographical%20Numbers/README.md)
+  - [0387.字符串中的第一个唯一字符](/solution/0300-0399/0387.First%20Unique%20Character%20in%20a%20String/README.md)
+  - [0388.文件的最长绝对路径](/solution/0300-0399/0388.Longest%20Absolute%20File%20Path/README.md)
+  - [0389.找不同](/solution/0300-0399/0389.Find%20the%20Difference/README.md)
+  - [0390.消除游戏](/solution/0300-0399/0390.Elimination%20Game/README.md)
+  - [0391.完美矩形](/solution/0300-0399/0391.Perfect%20Rectangle/README.md)
+  - [0392.判断子序列](/solution/0300-0399/0392.Is%20Subsequence/README.md)
+  - [0393.UTF-8 编码验证](/solution/0300-0399/0393.UTF-8%20Validation/README.md)
+  - [0394.字符串解码](/solution/0300-0399/0394.Decode%20String/README.md)
+  - [0395.至少有 K 个重复字符的最长子串](/solution/0300-0399/0395.Longest%20Substring%20with%20At%20Least%20K%20Repeating%20Characters/README.md)
+  - [0396.旋转函数](/solution/0300-0399/0396.Rotate%20Function/README.md)
+  - [0397.整数替换](/solution/0300-0399/0397.Integer%20Replacement/README.md)
+  - [0398.随机数索引](/solution/0300-0399/0398.Random%20Pick%20Index/README.md)
+  - [0399.除法求值](/solution/0300-0399/0399.Evaluate%20Division/README.md)
 
 - 0400-0499
-  - [0400.Nth Digit](/solution/0400-0499/0400.Nth%20Digit/README.md)
-  - [0401.Binary Watch](/solution/0400-0499/0401.Binary%20Watch/README.md)
-  - [0402.Remove K Digits](/solution/0400-0499/0402.Remove%20K%20Digits/README.md)
-  - [0403.Frog Jump](/solution/0400-0499/0403.Frog%20Jump/README.md)
-  - [0404.Sum of Left Leaves](/solution/0400-0499/0404.Sum%20of%20Left%20Leaves/README.md)
-  - [0405.Convert a Number to Hexadecimal](/solution/0400-0499/0405.Convert%20a%20Number%20to%20Hexadecimal/README.md)
-  - [0406.Queue Reconstruction by Height](/solution/0400-0499/0406.Queue%20Reconstruction%20by%20Height/README.md)
-  - [0407.Trapping Rain Water II](/solution/0400-0499/0407.Trapping%20Rain%20Water%20II/README.md)
-  - [0408.Valid Word Abbreviation](/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README.md)
-  - [0409.Longest Palindrome](/solution/0400-0499/0409.Longest%20Palindrome/README.md)
-  - [0410.Split Array Largest Sum](/solution/0400-0499/0410.Split%20Array%20Largest%20Sum/README.md)
-  - [0411.Minimum Unique Word Abbreviation](/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README.md)
+  - [0400.第 N 位数字](/solution/0400-0499/0400.Nth%20Digit/README.md)
+  - [0401.二进制手表](/solution/0400-0499/0401.Binary%20Watch/README.md)
+  - [0402.移掉 K 位数字](/solution/0400-0499/0402.Remove%20K%20Digits/README.md)
+  - [0403.青蛙过河](/solution/0400-0499/0403.Frog%20Jump/README.md)
+  - [0404.左叶子之和](/solution/0400-0499/0404.Sum%20of%20Left%20Leaves/README.md)
+  - [0405.数字转换为十六进制数](/solution/0400-0499/0405.Convert%20a%20Number%20to%20Hexadecimal/README.md)
+  - [0406.根据身高重建队列](/solution/0400-0499/0406.Queue%20Reconstruction%20by%20Height/README.md)
+  - [0407.接雨水 II](/solution/0400-0499/0407.Trapping%20Rain%20Water%20II/README.md)
+  - [0408.有效单词缩写](/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README.md)
+  - [0409.最长回文串](/solution/0400-0499/0409.Longest%20Palindrome/README.md)
+  - [0410.分割数组的最大值](/solution/0400-0499/0410.Split%20Array%20Largest%20Sum/README.md)
+  - [0411.最短独占单词缩写](/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README.md)
   - [0412.Fizz Buzz](/solution/0400-0499/0412.Fizz%20Buzz/README.md)
-  - [0413.Arithmetic Slices](/solution/0400-0499/0413.Arithmetic%20Slices/README.md)
-  - [0414.Third Maximum Number](/solution/0400-0499/0414.Third%20Maximum%20Number/README.md)
-  - [0415.Add Strings](/solution/0400-0499/0415.Add%20Strings/README.md)
-  - [0416.Partition Equal Subset Sum](/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README.md)
-  - [0417.Pacific Atlantic Water Flow](/solution/0400-0499/0417.Pacific%20Atlantic%20Water%20Flow/README.md)
-  - [0418.Sentence Screen Fitting](/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README.md)
-  - [0419.Battleships in a Board](/solution/0400-0499/0419.Battleships%20in%20a%20Board/README.md)
-  - [0420.Strong Password Checker](/solution/0400-0499/0420.Strong%20Password%20Checker/README.md)
-  - [0421.Maximum XOR of Two Numbers in an Array](/solution/0400-0499/0421.Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/README.md)
-  - [0422.Valid Word Square](/solution/0400-0499/0422.Valid%20Word%20Square/README.md)
-  - [0423.Reconstruct Original Digits from English](/solution/0400-0499/0423.Reconstruct%20Original%20Digits%20from%20English/README.md)
-  - [0424.Longest Repeating Character Replacement](/solution/0400-0499/0424.Longest%20Repeating%20Character%20Replacement/README.md)
-  - [0425.Word Squares](/solution/0400-0499/0425.Word%20Squares/README.md)
-  - [0426.Convert Binary Search Tree to Sorted Doubly Linked List](/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README.md)
-  - [0427.Construct Quad Tree](/solution/0400-0499/0427.Construct%20Quad%20Tree/README.md)
-  - [0428.Serialize and Deserialize N-ary Tree](/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README.md)
-  - [0429.N-ary Tree Level Order Traversal](/solution/0400-0499/0429.N-ary%20Tree%20Level%20Order%20Traversal/README.md)
-  - [0430.Flatten a Multilevel Doubly Linked List](/solution/0400-0499/0430.Flatten%20a%20Multilevel%20Doubly%20Linked%20List/README.md)
-  - [0431.Encode N-ary Tree to Binary Tree](/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README.md)
-  - [0432.All O one Data Structure](/solution/0400-0499/0432.All%20O%20one%20Data%20Structure/README.md)
-  - [0433.Minimum Genetic Mutation](/solution/0400-0499/0433.Minimum%20Genetic%20Mutation/README.md)
-  - [0434.Number of Segments in a String](/solution/0400-0499/0434.Number%20of%20Segments%20in%20a%20String/README.md)
-  - [0435.Non-overlapping Intervals](/solution/0400-0499/0435.Non-overlapping%20Intervals/README.md)
-  - [0436.Find Right Interval](/solution/0400-0499/0436.Find%20Right%20Interval/README.md)
-  - [0437.Path Sum III](/solution/0400-0499/0437.Path%20Sum%20III/README.md)
-  - [0438.Find All Anagrams in a String](/solution/0400-0499/0438.Find%20All%20Anagrams%20in%20a%20String/README.md)
-  - [0439.Ternary Expression Parser](/solution/0400-0499/0439.Ternary%20Expression%20Parser/README.md)
-  - [0440.K-th Smallest in Lexicographical Order](/solution/0400-0499/0440.K-th%20Smallest%20in%20Lexicographical%20Order/README.md)
-  - [0441.Arranging Coins](/solution/0400-0499/0441.Arranging%20Coins/README.md)
-  - [0442.Find All Duplicates in an Array](/solution/0400-0499/0442.Find%20All%20Duplicates%20in%20an%20Array/README.md)
-  - [0443.String Compression](/solution/0400-0499/0443.String%20Compression/README.md)
-  - [0444.Sequence Reconstruction](/solution/0400-0499/0444.Sequence%20Reconstruction/README.md)
-  - [0445.Add Two Numbers II](/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README.md)
-  - [0446.Arithmetic Slices II - Subsequence](/solution/0400-0499/0446.Arithmetic%20Slices%20II%20-%20Subsequence/README.md)
-  - [0447.Number of Boomerangs](/solution/0400-0499/0447.Number%20of%20Boomerangs/README.md)
-  - [0448.Find All Numbers Disappeared in an Array](/solution/0400-0499/0448.Find%20All%20Numbers%20Disappeared%20in%20an%20Array/README.md)
-  - [0449.Serialize and Deserialize BST](/solution/0400-0499/0449.Serialize%20and%20Deserialize%20BST/README.md)
-  - [0450.Delete Node in a BST](/solution/0400-0499/0450.Delete%20Node%20in%20a%20BST/README.md)
-  - [0451.Sort Characters By Frequency](/solution/0400-0499/0451.Sort%20Characters%20By%20Frequency/README.md)
-  - [0452.Minimum Number of Arrows to Burst Balloons](/solution/0400-0499/0452.Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/README.md)
-  - [0453.Minimum Moves to Equal Array Elements](/solution/0400-0499/0453.Minimum%20Moves%20to%20Equal%20Array%20Elements/README.md)
-  - [0454.4Sum II](/solution/0400-0499/0454.4Sum%20II/README.md)
-  - [0455.Assign Cookies](/solution/0400-0499/0455.Assign%20Cookies/README.md)
-  - [0456.132 Pattern](/solution/0400-0499/0456.132%20Pattern/README.md)
-  - [0457.Circular Array Loop](/solution/0400-0499/0457.Circular%20Array%20Loop/README.md)
-  - [0458.Poor Pigs](/solution/0400-0499/0458.Poor%20Pigs/README.md)
-  - [0459.Repeated Substring Pattern](/solution/0400-0499/0459.Repeated%20Substring%20Pattern/README.md)
-  - [0460.LFU Cache](/solution/0400-0499/0460.LFU%20Cache/README.md)
-  - [0461.Hamming Distance](/solution/0400-0499/0461.Hamming%20Distance/README.md)
-  - [0462.Minimum Moves to Equal Array Elements II](/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README.md)
-  - [0463.Island Perimeter](/solution/0400-0499/0463.Island%20Perimeter/README.md)
-  - [0464.Can I Win](/solution/0400-0499/0464.Can%20I%20Win/README.md)
-  - [0465.Optimal Account Balancing](/solution/0400-0499/0465.Optimal%20Account%20Balancing/README.md)
-  - [0466.Count The Repetitions](/solution/0400-0499/0466.Count%20The%20Repetitions/README.md)
-  - [0467.Unique Substrings in Wraparound String](/solution/0400-0499/0467.Unique%20Substrings%20in%20Wraparound%20String/README.md)
-  - [0468.Validate IP Address](/solution/0400-0499/0468.Validate%20IP%20Address/README.md)
-  - [0469.Convex Polygon](/solution/0400-0499/0469.Convex%20Polygon/README.md)
-  - [0470.Implement Rand10() Using Rand7()](/solution/0400-0499/0470.Implement%20Rand10%28%29%20Using%20Rand7%28%29/README.md)
-  - [0471.Encode String with Shortest Length](/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README.md)
-  - [0472.Concatenated Words](/solution/0400-0499/0472.Concatenated%20Words/README.md)
-  - [0473.Matchsticks to Square](/solution/0400-0499/0473.Matchsticks%20to%20Square/README.md)
-  - [0474.Ones and Zeroes](/solution/0400-0499/0474.Ones%20and%20Zeroes/README.md)
-  - [0475.Heaters](/solution/0400-0499/0475.Heaters/README.md)
-  - [0476.Number Complement](/solution/0400-0499/0476.Number%20Complement/README.md)
-  - [0477.Total Hamming Distance](/solution/0400-0499/0477.Total%20Hamming%20Distance/README.md)
-  - [0478.Generate Random Point in a Circle](/solution/0400-0499/0478.Generate%20Random%20Point%20in%20a%20Circle/README.md)
-  - [0479.Largest Palindrome Product](/solution/0400-0499/0479.Largest%20Palindrome%20Product/README.md)
-  - [0480.Sliding Window Median](/solution/0400-0499/0480.Sliding%20Window%20Median/README.md)
-  - [0481.Magical String](/solution/0400-0499/0481.Magical%20String/README.md)
-  - [0482.License Key Formatting](/solution/0400-0499/0482.License%20Key%20Formatting/README.md)
-  - [0483.Smallest Good Base](/solution/0400-0499/0483.Smallest%20Good%20Base/README.md)
-  - [0484.Find Permutation](/solution/0400-0499/0484.Find%20Permutation/README.md)
-  - [0485.Max Consecutive Ones](/solution/0400-0499/0485.Max%20Consecutive%20Ones/README.md)
-  - [0486.Predict the Winner](/solution/0400-0499/0486.Predict%20the%20Winner/README.md)
-  - [0487.Max Consecutive Ones II](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README.md)
-  - [0488.Zuma Game](/solution/0400-0499/0488.Zuma%20Game/README.md)
-  - [0489.Robot Room Cleaner](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README.md)
-  - [0490.The Maze](/solution/0400-0499/0490.The%20Maze/README.md)
-  - [0491.Increasing Subsequences](/solution/0400-0499/0491.Increasing%20Subsequences/README.md)
-  - [0492.Construct the Rectangle](/solution/0400-0499/0492.Construct%20the%20Rectangle/README.md)
-  - [0493.Reverse Pairs](/solution/0400-0499/0493.Reverse%20Pairs/README.md)
-  - [0494.Target Sum](/solution/0400-0499/0494.Target%20Sum/README.md)
-  - [0495.Teemo Attacking](/solution/0400-0499/0495.Teemo%20Attacking/README.md)
-  - [0496.Next Greater Element I](/solution/0400-0499/0496.Next%20Greater%20Element%20I/README.md)
-  - [0497.Random Point in Non-overlapping Rectangles](/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README.md)
-  - [0498.Diagonal Traverse](/solution/0400-0499/0498.Diagonal%20Traverse/README.md)
-  - [0499.The Maze III](/solution/0400-0499/0499.The%20Maze%20III/README.md)
+  - [0413.等差数列划分](/solution/0400-0499/0413.Arithmetic%20Slices/README.md)
+  - [0414.第三大的数](/solution/0400-0499/0414.Third%20Maximum%20Number/README.md)
+  - [0415.字符串相加](/solution/0400-0499/0415.Add%20Strings/README.md)
+  - [0416.分割等和子集](/solution/0400-0499/0416.Partition%20Equal%20Subset%20Sum/README.md)
+  - [0417.太平洋大西洋水流问题](/solution/0400-0499/0417.Pacific%20Atlantic%20Water%20Flow/README.md)
+  - [0418.屏幕可显示句子的数量](/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README.md)
+  - [0419.甲板上的战舰](/solution/0400-0499/0419.Battleships%20in%20a%20Board/README.md)
+  - [0420.强密码检验器](/solution/0400-0499/0420.Strong%20Password%20Checker/README.md)
+  - [0421.数组中两个数的最大异或值](/solution/0400-0499/0421.Maximum%20XOR%20of%20Two%20Numbers%20in%20an%20Array/README.md)
+  - [0422.有效的单词方块](/solution/0400-0499/0422.Valid%20Word%20Square/README.md)
+  - [0423.从英文中重建数字](/solution/0400-0499/0423.Reconstruct%20Original%20Digits%20from%20English/README.md)
+  - [0424.替换后的最长重复字符](/solution/0400-0499/0424.Longest%20Repeating%20Character%20Replacement/README.md)
+  - [0425.单词方块](/solution/0400-0499/0425.Word%20Squares/README.md)
+  - [0426.将二叉搜索树转化为排序的双向链表](/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README.md)
+  - [0427.建立四叉树](/solution/0400-0499/0427.Construct%20Quad%20Tree/README.md)
+  - [0428.序列化和反序列化 N 叉树](/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README.md)
+  - [0429.N 叉树的层序遍历](/solution/0400-0499/0429.N-ary%20Tree%20Level%20Order%20Traversal/README.md)
+  - [0430.扁平化多级双向链表](/solution/0400-0499/0430.Flatten%20a%20Multilevel%20Doubly%20Linked%20List/README.md)
+  - [0431.将 N 叉树编码为二叉树](/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README.md)
+  - [0432.全 O(1) 的数据结构](/solution/0400-0499/0432.All%20O%20one%20Data%20Structure/README.md)
+  - [0433.最小基因变化](/solution/0400-0499/0433.Minimum%20Genetic%20Mutation/README.md)
+  - [0434.字符串中的单词数](/solution/0400-0499/0434.Number%20of%20Segments%20in%20a%20String/README.md)
+  - [0435.无重叠区间](/solution/0400-0499/0435.Non-overlapping%20Intervals/README.md)
+  - [0436.寻找右区间](/solution/0400-0499/0436.Find%20Right%20Interval/README.md)
+  - [0437.路径总和 III](/solution/0400-0499/0437.Path%20Sum%20III/README.md)
+  - [0438.找到字符串中所有字母异位词](/solution/0400-0499/0438.Find%20All%20Anagrams%20in%20a%20String/README.md)
+  - [0439.三元表达式解析器](/solution/0400-0499/0439.Ternary%20Expression%20Parser/README.md)
+  - [0440.字典序的第K小数字](/solution/0400-0499/0440.K-th%20Smallest%20in%20Lexicographical%20Order/README.md)
+  - [0441.排列硬币](/solution/0400-0499/0441.Arranging%20Coins/README.md)
+  - [0442.数组中重复的数据](/solution/0400-0499/0442.Find%20All%20Duplicates%20in%20an%20Array/README.md)
+  - [0443.压缩字符串](/solution/0400-0499/0443.String%20Compression/README.md)
+  - [0444.序列重建](/solution/0400-0499/0444.Sequence%20Reconstruction/README.md)
+  - [0445.两数相加 II](/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README.md)
+  - [0446.等差数列划分 II - 子序列](/solution/0400-0499/0446.Arithmetic%20Slices%20II%20-%20Subsequence/README.md)
+  - [0447.回旋镖的数量](/solution/0400-0499/0447.Number%20of%20Boomerangs/README.md)
+  - [0448.找到所有数组中消失的数字](/solution/0400-0499/0448.Find%20All%20Numbers%20Disappeared%20in%20an%20Array/README.md)
+  - [0449.序列化和反序列化二叉搜索树](/solution/0400-0499/0449.Serialize%20and%20Deserialize%20BST/README.md)
+  - [0450.删除二叉搜索树中的节点](/solution/0400-0499/0450.Delete%20Node%20in%20a%20BST/README.md)
+  - [0451.根据字符出现频率排序](/solution/0400-0499/0451.Sort%20Characters%20By%20Frequency/README.md)
+  - [0452.用最少数量的箭引爆气球](/solution/0400-0499/0452.Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons/README.md)
+  - [0453.最小操作次数使数组元素相等](/solution/0400-0499/0453.Minimum%20Moves%20to%20Equal%20Array%20Elements/README.md)
+  - [0454.四数相加 II](/solution/0400-0499/0454.4Sum%20II/README.md)
+  - [0455.分发饼干](/solution/0400-0499/0455.Assign%20Cookies/README.md)
+  - [0456.132 模式](/solution/0400-0499/0456.132%20Pattern/README.md)
+  - [0457.环形数组是否存在循环](/solution/0400-0499/0457.Circular%20Array%20Loop/README.md)
+  - [0458.可怜的小猪](/solution/0400-0499/0458.Poor%20Pigs/README.md)
+  - [0459.重复的子字符串](/solution/0400-0499/0459.Repeated%20Substring%20Pattern/README.md)
+  - [0460.LFU 缓存](/solution/0400-0499/0460.LFU%20Cache/README.md)
+  - [0461.汉明距离](/solution/0400-0499/0461.Hamming%20Distance/README.md)
+  - [0462.最少移动次数使数组元素相等 II](/solution/0400-0499/0462.Minimum%20Moves%20to%20Equal%20Array%20Elements%20II/README.md)
+  - [0463.岛屿的周长](/solution/0400-0499/0463.Island%20Perimeter/README.md)
+  - [0464.我能赢吗](/solution/0400-0499/0464.Can%20I%20Win/README.md)
+  - [0465.最优账单平衡](/solution/0400-0499/0465.Optimal%20Account%20Balancing/README.md)
+  - [0466.统计重复个数](/solution/0400-0499/0466.Count%20The%20Repetitions/README.md)
+  - [0467.环绕字符串中唯一的子字符串](/solution/0400-0499/0467.Unique%20Substrings%20in%20Wraparound%20String/README.md)
+  - [0468.验证IP地址](/solution/0400-0499/0468.Validate%20IP%20Address/README.md)
+  - [0469.凸多边形](/solution/0400-0499/0469.Convex%20Polygon/README.md)
+  - [0470.用 Rand7() 实现 Rand10()](/solution/0400-0499/0470.Implement%20Rand10%28%29%20Using%20Rand7%28%29/README.md)
+  - [0471.编码最短长度的字符串](/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README.md)
+  - [0472.连接词](/solution/0400-0499/0472.Concatenated%20Words/README.md)
+  - [0473.火柴拼正方形](/solution/0400-0499/0473.Matchsticks%20to%20Square/README.md)
+  - [0474.一和零](/solution/0400-0499/0474.Ones%20and%20Zeroes/README.md)
+  - [0475.供暖器](/solution/0400-0499/0475.Heaters/README.md)
+  - [0476.数字的补数](/solution/0400-0499/0476.Number%20Complement/README.md)
+  - [0477.汉明距离总和](/solution/0400-0499/0477.Total%20Hamming%20Distance/README.md)
+  - [0478.在圆内随机生成点](/solution/0400-0499/0478.Generate%20Random%20Point%20in%20a%20Circle/README.md)
+  - [0479.最大回文数乘积](/solution/0400-0499/0479.Largest%20Palindrome%20Product/README.md)
+  - [0480.滑动窗口中位数](/solution/0400-0499/0480.Sliding%20Window%20Median/README.md)
+  - [0481.神奇字符串](/solution/0400-0499/0481.Magical%20String/README.md)
+  - [0482.密钥格式化](/solution/0400-0499/0482.License%20Key%20Formatting/README.md)
+  - [0483.最小好进制](/solution/0400-0499/0483.Smallest%20Good%20Base/README.md)
+  - [0484.寻找排列](/solution/0400-0499/0484.Find%20Permutation/README.md)
+  - [0485.最大连续 1 的个数](/solution/0400-0499/0485.Max%20Consecutive%20Ones/README.md)
+  - [0486.预测赢家](/solution/0400-0499/0486.Predict%20the%20Winner/README.md)
+  - [0487.最大连续1的个数 II](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README.md)
+  - [0488.祖玛游戏](/solution/0400-0499/0488.Zuma%20Game/README.md)
+  - [0489.扫地机器人](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README.md)
+  - [0490.迷宫](/solution/0400-0499/0490.The%20Maze/README.md)
+  - [0491.递增子序列](/solution/0400-0499/0491.Increasing%20Subsequences/README.md)
+  - [0492.构造矩形](/solution/0400-0499/0492.Construct%20the%20Rectangle/README.md)
+  - [0493.翻转对](/solution/0400-0499/0493.Reverse%20Pairs/README.md)
+  - [0494.目标和](/solution/0400-0499/0494.Target%20Sum/README.md)
+  - [0495.提莫攻击](/solution/0400-0499/0495.Teemo%20Attacking/README.md)
+  - [0496.下一个更大元素 I](/solution/0400-0499/0496.Next%20Greater%20Element%20I/README.md)
+  - [0497.非重叠矩形中的随机点](/solution/0400-0499/0497.Random%20Point%20in%20Non-overlapping%20Rectangles/README.md)
+  - [0498.对角线遍历](/solution/0400-0499/0498.Diagonal%20Traverse/README.md)
+  - [0499.迷宫 III](/solution/0400-0499/0499.The%20Maze%20III/README.md)
 
 - 0500-0599
-  - [0500.Keyboard Row](/solution/0500-0599/0500.Keyboard%20Row/README.md)
-  - [0501.Find Mode in Binary Search Tree](/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README.md)
+  - [0500.键盘行](/solution/0500-0599/0500.Keyboard%20Row/README.md)
+  - [0501.二叉搜索树中的众数](/solution/0500-0599/0501.Find%20Mode%20in%20Binary%20Search%20Tree/README.md)
   - [0502.IPO](/solution/0500-0599/0502.IPO/README.md)
-  - [0503.Next Greater Element II](/solution/0500-0599/0503.Next%20Greater%20Element%20II/README.md)
-  - [0504.Base 7](/solution/0500-0599/0504.Base%207/README.md)
-  - [0505.The Maze II](/solution/0500-0599/0505.The%20Maze%20II/README.md)
-  - [0506.Relative Ranks](/solution/0500-0599/0506.Relative%20Ranks/README.md)
-  - [0507.Perfect Number](/solution/0500-0599/0507.Perfect%20Number/README.md)
-  - [0508.Most Frequent Subtree Sum](/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README.md)
-  - [0509.Fibonacci Number](/solution/0500-0599/0509.Fibonacci%20Number/README.md)
-  - [0510.Inorder Successor in BST II](/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README.md)
-  - [0511.Game Play Analysis I](/solution/0500-0599/0511.Game%20Play%20Analysis%20I/README.md)
-  - [0512.Game Play Analysis II](/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README.md)
-  - [0513.Find Bottom Left Tree Value](/solution/0500-0599/0513.Find%20Bottom%20Left%20Tree%20Value/README.md)
-  - [0514.Freedom Trail](/solution/0500-0599/0514.Freedom%20Trail/README.md)
-  - [0515.Find Largest Value in Each Tree Row](/solution/0500-0599/0515.Find%20Largest%20Value%20in%20Each%20Tree%20Row/README.md)
-  - [0516.Longest Palindromic Subsequence](/solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README.md)
-  - [0517.Super Washing Machines](/solution/0500-0599/0517.Super%20Washing%20Machines/README.md)
-  - [0518.Coin Change 2](/solution/0500-0599/0518.Coin%20Change%202/README.md)
-  - [0519.Random Flip Matrix](/solution/0500-0599/0519.Random%20Flip%20Matrix/README.md)
-  - [0520.Detect Capital](/solution/0500-0599/0520.Detect%20Capital/README.md)
-  - [0521.Longest Uncommon Subsequence I](/solution/0500-0599/0521.Longest%20Uncommon%20Subsequence%20I/README.md)
-  - [0522.Longest Uncommon Subsequence II](/solution/0500-0599/0522.Longest%20Uncommon%20Subsequence%20II/README.md)
-  - [0523.Continuous Subarray Sum](/solution/0500-0599/0523.Continuous%20Subarray%20Sum/README.md)
-  - [0524.Longest Word in Dictionary through Deleting](/solution/0500-0599/0524.Longest%20Word%20in%20Dictionary%20through%20Deleting/README.md)
-  - [0525.Contiguous Array](/solution/0500-0599/0525.Contiguous%20Array/README.md)
-  - [0526.Beautiful Arrangement](/solution/0500-0599/0526.Beautiful%20Arrangement/README.md)
-  - [0527.Word Abbreviation](/solution/0500-0599/0527.Word%20Abbreviation/README.md)
-  - [0528.Random Pick with Weight](/solution/0500-0599/0528.Random%20Pick%20with%20Weight/README.md)
-  - [0529.Minesweeper](/solution/0500-0599/0529.Minesweeper/README.md)
-  - [0530.Minimum Absolute Difference in BST](/solution/0500-0599/0530.Minimum%20Absolute%20Difference%20in%20BST/README.md)
-  - [0531.Lonely Pixel I](/solution/0500-0599/0531.Lonely%20Pixel%20I/README.md)
-  - [0532.K-diff Pairs in an Array](/solution/0500-0599/0532.K-diff%20Pairs%20in%20an%20Array/README.md)
-  - [0533.Lonely Pixel II](/solution/0500-0599/0533.Lonely%20Pixel%20II/README.md)
-  - [0534.Game Play Analysis III](/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README.md)
-  - [0535.Encode and Decode TinyURL](/solution/0500-0599/0535.Encode%20and%20Decode%20TinyURL/README.md)
-  - [0536.Construct Binary Tree from String](/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README.md)
-  - [0537.Complex Number Multiplication](/solution/0500-0599/0537.Complex%20Number%20Multiplication/README.md)
-  - [0538.Convert BST to Greater Tree](/solution/0500-0599/0538.Convert%20BST%20to%20Greater%20Tree/README.md)
-  - [0539.Minimum Time Difference](/solution/0500-0599/0539.Minimum%20Time%20Difference/README.md)
-  - [0540.Single Element in a Sorted Array](/solution/0500-0599/0540.Single%20Element%20in%20a%20Sorted%20Array/README.md)
-  - [0541.Reverse String II](/solution/0500-0599/0541.Reverse%20String%20II/README.md)
-  - [0542.01 Matrix](/solution/0500-0599/0542.01%20Matrix/README.md)
-  - [0543.Diameter of Binary Tree](/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README.md)
-  - [0544.Output Contest Matches](/solution/0500-0599/0544.Output%20Contest%20Matches/README.md)
-  - [0545.Boundary of Binary Tree](/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README.md)
-  - [0546.Remove Boxes](/solution/0500-0599/0546.Remove%20Boxes/README.md)
-  - [0547.Number of Provinces](/solution/0500-0599/0547.Number%20of%20Provinces/README.md)
-  - [0548.Split Array with Equal Sum](/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README.md)
-  - [0549.Binary Tree Longest Consecutive Sequence II](/solution/0500-0599/0549.Binary%20Tree%20Longest%20Consecutive%20Sequence%20II/README.md)
-  - [0550.Game Play Analysis IV](/solution/0500-0599/0550.Game%20Play%20Analysis%20IV/README.md)
-  - [0551.Student Attendance Record I](/solution/0500-0599/0551.Student%20Attendance%20Record%20I/README.md)
-  - [0552.Student Attendance Record II](/solution/0500-0599/0552.Student%20Attendance%20Record%20II/README.md)
-  - [0553.Optimal Division](/solution/0500-0599/0553.Optimal%20Division/README.md)
-  - [0554.Brick Wall](/solution/0500-0599/0554.Brick%20Wall/README.md)
-  - [0555.Split Concatenated Strings](/solution/0500-0599/0555.Split%20Concatenated%20Strings/README.md)
-  - [0556.Next Greater Element III](/solution/0500-0599/0556.Next%20Greater%20Element%20III/README.md)
-  - [0557.Reverse Words in a String III](/solution/0500-0599/0557.Reverse%20Words%20in%20a%20String%20III/README.md)
-  - [0558.Logical OR of Two Binary Grids Represented as Quad-Trees](/solution/0500-0599/0558.Logical%20OR%20of%20Two%20Binary%20Grids%20Represented%20as%20Quad-Trees/README.md)
-  - [0559.Maximum Depth of N-ary Tree](/solution/0500-0599/0559.Maximum%20Depth%20of%20N-ary%20Tree/README.md)
-  - [0560.Subarray Sum Equals K](/solution/0500-0599/0560.Subarray%20Sum%20Equals%20K/README.md)
-  - [0561.Array Partition I](/solution/0500-0599/0561.Array%20Partition%20I/README.md)
-  - [0562.Longest Line of Consecutive One in Matrix](/solution/0500-0599/0562.Longest%20Line%20of%20Consecutive%20One%20in%20Matrix/README.md)
-  - [0563.Binary Tree Tilt](/solution/0500-0599/0563.Binary%20Tree%20Tilt/README.md)
-  - [0564.Find the Closest Palindrome](/solution/0500-0599/0564.Find%20the%20Closest%20Palindrome/README.md)
-  - [0565.Array Nesting](/solution/0500-0599/0565.Array%20Nesting/README.md)
-  - [0566.Reshape the Matrix](/solution/0500-0599/0566.Reshape%20the%20Matrix/README.md)
-  - [0567.Permutation in String](/solution/0500-0599/0567.Permutation%20in%20String/README.md)
-  - [0568.Maximum Vacation Days](/solution/0500-0599/0568.Maximum%20Vacation%20Days/README.md)
-  - [0569.Median Employee Salary](/solution/0500-0599/0569.Median%20Employee%20Salary/README.md)
-  - [0570.Managers with at Least 5 Direct Reports](/solution/0500-0599/0570.Managers%20with%20at%20Least%205%20Direct%20Reports/README.md)
-  - [0571.Find Median Given Frequency of Numbers](/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README.md)
-  - [0572.Subtree of Another Tree](/solution/0500-0599/0572.Subtree%20of%20Another%20Tree/README.md)
-  - [0573.Squirrel Simulation](/solution/0500-0599/0573.Squirrel%20Simulation/README.md)
-  - [0574.Winning Candidate](/solution/0500-0599/0574.Winning%20Candidate/README.md)
-  - [0575.Distribute Candies](/solution/0500-0599/0575.Distribute%20Candies/README.md)
-  - [0576.Out of Boundary Paths](/solution/0500-0599/0576.Out%20of%20Boundary%20Paths/README.md)
-  - [0577.Employee Bonus](/solution/0500-0599/0577.Employee%20Bonus/README.md)
-  - [0578.Get Highest Answer Rate Question](/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README.md)
-  - [0579.Find Cumulative Salary of an Employee](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md)
-  - [0580.Count Student Number in Departments](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md)
-  - [0581.Shortest Unsorted Continuous Subarray](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README.md)
+  - [0503.下一个更大元素 II](/solution/0500-0599/0503.Next%20Greater%20Element%20II/README.md)
+  - [0504.七进制数](/solution/0500-0599/0504.Base%207/README.md)
+  - [0505.迷宫 II](/solution/0500-0599/0505.The%20Maze%20II/README.md)
+  - [0506.相对名次](/solution/0500-0599/0506.Relative%20Ranks/README.md)
+  - [0507.完美数](/solution/0500-0599/0507.Perfect%20Number/README.md)
+  - [0508.出现次数最多的子树元素和](/solution/0500-0599/0508.Most%20Frequent%20Subtree%20Sum/README.md)
+  - [0509.斐波那契数](/solution/0500-0599/0509.Fibonacci%20Number/README.md)
+  - [0510.二叉搜索树中的中序后继 II](/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README.md)
+  - [0511.游戏玩法分析 I](/solution/0500-0599/0511.Game%20Play%20Analysis%20I/README.md)
+  - [0512.游戏玩法分析 II](/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README.md)
+  - [0513.找树左下角的值](/solution/0500-0599/0513.Find%20Bottom%20Left%20Tree%20Value/README.md)
+  - [0514.自由之路](/solution/0500-0599/0514.Freedom%20Trail/README.md)
+  - [0515.在每个树行中找最大值](/solution/0500-0599/0515.Find%20Largest%20Value%20in%20Each%20Tree%20Row/README.md)
+  - [0516.最长回文子序列](/solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README.md)
+  - [0517.超级洗衣机](/solution/0500-0599/0517.Super%20Washing%20Machines/README.md)
+  - [0518.零钱兑换 II](/solution/0500-0599/0518.Coin%20Change%202/README.md)
+  - [0519.随机翻转矩阵](/solution/0500-0599/0519.Random%20Flip%20Matrix/README.md)
+  - [0520.检测大写字母](/solution/0500-0599/0520.Detect%20Capital/README.md)
+  - [0521.最长特殊序列 Ⅰ](/solution/0500-0599/0521.Longest%20Uncommon%20Subsequence%20I/README.md)
+  - [0522.最长特殊序列 II](/solution/0500-0599/0522.Longest%20Uncommon%20Subsequence%20II/README.md)
+  - [0523.连续的子数组和](/solution/0500-0599/0523.Continuous%20Subarray%20Sum/README.md)
+  - [0524.通过删除字母匹配到字典里最长单词](/solution/0500-0599/0524.Longest%20Word%20in%20Dictionary%20through%20Deleting/README.md)
+  - [0525.连续数组](/solution/0500-0599/0525.Contiguous%20Array/README.md)
+  - [0526.优美的排列](/solution/0500-0599/0526.Beautiful%20Arrangement/README.md)
+  - [0527.单词缩写](/solution/0500-0599/0527.Word%20Abbreviation/README.md)
+  - [0528.按权重随机选择](/solution/0500-0599/0528.Random%20Pick%20with%20Weight/README.md)
+  - [0529.扫雷游戏](/solution/0500-0599/0529.Minesweeper/README.md)
+  - [0530.二叉搜索树的最小绝对差](/solution/0500-0599/0530.Minimum%20Absolute%20Difference%20in%20BST/README.md)
+  - [0531.孤独像素 I](/solution/0500-0599/0531.Lonely%20Pixel%20I/README.md)
+  - [0532.数组中的 k-diff 数对](/solution/0500-0599/0532.K-diff%20Pairs%20in%20an%20Array/README.md)
+  - [0533.孤独像素 II](/solution/0500-0599/0533.Lonely%20Pixel%20II/README.md)
+  - [0534.游戏玩法分析 III](/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README.md)
+  - [0535.TinyURL 的加密与解密](/solution/0500-0599/0535.Encode%20and%20Decode%20TinyURL/README.md)
+  - [0536.从字符串生成二叉树](/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README.md)
+  - [0537.复数乘法](/solution/0500-0599/0537.Complex%20Number%20Multiplication/README.md)
+  - [0538.把二叉搜索树转换为累加树](/solution/0500-0599/0538.Convert%20BST%20to%20Greater%20Tree/README.md)
+  - [0539.最小时间差](/solution/0500-0599/0539.Minimum%20Time%20Difference/README.md)
+  - [0540.有序数组中的单一元素](/solution/0500-0599/0540.Single%20Element%20in%20a%20Sorted%20Array/README.md)
+  - [0541.反转字符串 II](/solution/0500-0599/0541.Reverse%20String%20II/README.md)
+  - [0542.01 矩阵](/solution/0500-0599/0542.01%20Matrix/README.md)
+  - [0543.二叉树的直径](/solution/0500-0599/0543.Diameter%20of%20Binary%20Tree/README.md)
+  - [0544.输出比赛匹配对](/solution/0500-0599/0544.Output%20Contest%20Matches/README.md)
+  - [0545.二叉树的边界](/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README.md)
+  - [0546.移除盒子](/solution/0500-0599/0546.Remove%20Boxes/README.md)
+  - [0547.省份数量](/solution/0500-0599/0547.Number%20of%20Provinces/README.md)
+  - [0548.将数组分割成和相等的子数组](/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README.md)
+  - [0549.二叉树中最长的连续序列](/solution/0500-0599/0549.Binary%20Tree%20Longest%20Consecutive%20Sequence%20II/README.md)
+  - [0550.游戏玩法分析 IV](/solution/0500-0599/0550.Game%20Play%20Analysis%20IV/README.md)
+  - [0551.学生出勤记录 I](/solution/0500-0599/0551.Student%20Attendance%20Record%20I/README.md)
+  - [0552.学生出勤记录 II](/solution/0500-0599/0552.Student%20Attendance%20Record%20II/README.md)
+  - [0553.最优除法](/solution/0500-0599/0553.Optimal%20Division/README.md)
+  - [0554.砖墙](/solution/0500-0599/0554.Brick%20Wall/README.md)
+  - [0555.分割连接字符串](/solution/0500-0599/0555.Split%20Concatenated%20Strings/README.md)
+  - [0556.下一个更大元素 III](/solution/0500-0599/0556.Next%20Greater%20Element%20III/README.md)
+  - [0557.反转字符串中的单词 III](/solution/0500-0599/0557.Reverse%20Words%20in%20a%20String%20III/README.md)
+  - [0558.四叉树交集](/solution/0500-0599/0558.Logical%20OR%20of%20Two%20Binary%20Grids%20Represented%20as%20Quad-Trees/README.md)
+  - [0559.N 叉树的最大深度](/solution/0500-0599/0559.Maximum%20Depth%20of%20N-ary%20Tree/README.md)
+  - [0560.和为 K 的子数组](/solution/0500-0599/0560.Subarray%20Sum%20Equals%20K/README.md)
+  - [0561.数组拆分 I](/solution/0500-0599/0561.Array%20Partition%20I/README.md)
+  - [0562.矩阵中最长的连续1线段](/solution/0500-0599/0562.Longest%20Line%20of%20Consecutive%20One%20in%20Matrix/README.md)
+  - [0563.二叉树的坡度](/solution/0500-0599/0563.Binary%20Tree%20Tilt/README.md)
+  - [0564.寻找最近的回文数](/solution/0500-0599/0564.Find%20the%20Closest%20Palindrome/README.md)
+  - [0565.数组嵌套](/solution/0500-0599/0565.Array%20Nesting/README.md)
+  - [0566.重塑矩阵](/solution/0500-0599/0566.Reshape%20the%20Matrix/README.md)
+  - [0567.字符串的排列](/solution/0500-0599/0567.Permutation%20in%20String/README.md)
+  - [0568.最大休假天数](/solution/0500-0599/0568.Maximum%20Vacation%20Days/README.md)
+  - [0569.员工薪水中位数](/solution/0500-0599/0569.Median%20Employee%20Salary/README.md)
+  - [0570.至少有5名直接下属的经理](/solution/0500-0599/0570.Managers%20with%20at%20Least%205%20Direct%20Reports/README.md)
+  - [0571.给定数字的频率查询中位数](/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README.md)
+  - [0572.另一棵树的子树](/solution/0500-0599/0572.Subtree%20of%20Another%20Tree/README.md)
+  - [0573.松鼠模拟](/solution/0500-0599/0573.Squirrel%20Simulation/README.md)
+  - [0574.当选者](/solution/0500-0599/0574.Winning%20Candidate/README.md)
+  - [0575.分糖果](/solution/0500-0599/0575.Distribute%20Candies/README.md)
+  - [0576.出界的路径数](/solution/0500-0599/0576.Out%20of%20Boundary%20Paths/README.md)
+  - [0577.员工奖金](/solution/0500-0599/0577.Employee%20Bonus/README.md)
+  - [0578.查询回答率最高的问题](/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README.md)
+  - [0579.查询员工的累计薪水](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md)
+  - [0580.统计各专业学生人数](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md)
+  - [0581.最短无序连续子数组](/solution/0500-0599/0581.Shortest%20Unsorted%20Continuous%20Subarray/README.md)
   - [0582.Kill Process](/solution/0500-0599/0582.Kill%20Process/README.md)
-  - [0583.Delete Operation for Two Strings](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md)
-  - [0584.Find Customer Referee](/solution/0500-0599/0584.Find%20Customer%20Referee/README.md)
-  - [0585.Investments in 2016](/solution/0500-0599/0585.Investments%20in%202016/README.md)
-  - [0586.Customer Placing the Largest Number of Orders](/solution/0500-0599/0586.Customer%20Placing%20the%20Largest%20Number%20of%20Orders/README.md)
-  - [0587.Erect the Fence](/solution/0500-0599/0587.Erect%20the%20Fence/README.md)
-  - [0588.Design In-Memory File System](/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README.md)
-  - [0589.N-ary Tree Preorder Traversal](/solution/0500-0599/0589.N-ary%20Tree%20Preorder%20Traversal/README.md)
-  - [0590.N-ary Tree Postorder Traversal](/solution/0500-0599/0590.N-ary%20Tree%20Postorder%20Traversal/README.md)
-  - [0591.Tag Validator](/solution/0500-0599/0591.Tag%20Validator/README.md)
-  - [0592.Fraction Addition and Subtraction](/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README.md)
-  - [0593.Valid Square](/solution/0500-0599/0593.Valid%20Square/README.md)
-  - [0594.Longest Harmonious Subsequence](/solution/0500-0599/0594.Longest%20Harmonious%20Subsequence/README.md)
-  - [0595.Big Countries](/solution/0500-0599/0595.Big%20Countries/README.md)
-  - [0596.Classes More Than 5 Students](/solution/0500-0599/0596.Classes%20More%20Than%205%20Students/README.md)
-  - [0597.Friend Requests I Overall Acceptance Rate](/solution/0500-0599/0597.Friend%20Requests%20I%20Overall%20Acceptance%20Rate/README.md)
-  - [0598.Range Addition II](/solution/0500-0599/0598.Range%20Addition%20II/README.md)
-  - [0599.Minimum Index Sum of Two Lists](/solution/0500-0599/0599.Minimum%20Index%20Sum%20of%20Two%20Lists/README.md)
+  - [0583.两个字符串的删除操作](/solution/0500-0599/0583.Delete%20Operation%20for%20Two%20Strings/README.md)
+  - [0584.寻找用户推荐人](/solution/0500-0599/0584.Find%20Customer%20Referee/README.md)
+  - [0585.2016年的投资](/solution/0500-0599/0585.Investments%20in%202016/README.md)
+  - [0586.订单最多的客户](/solution/0500-0599/0586.Customer%20Placing%20the%20Largest%20Number%20of%20Orders/README.md)
+  - [0587.安装栅栏](/solution/0500-0599/0587.Erect%20the%20Fence/README.md)
+  - [0588.设计内存文件系统](/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README.md)
+  - [0589.N 叉树的前序遍历](/solution/0500-0599/0589.N-ary%20Tree%20Preorder%20Traversal/README.md)
+  - [0590.N 叉树的后序遍历](/solution/0500-0599/0590.N-ary%20Tree%20Postorder%20Traversal/README.md)
+  - [0591.标签验证器](/solution/0500-0599/0591.Tag%20Validator/README.md)
+  - [0592.分数加减运算](/solution/0500-0599/0592.Fraction%20Addition%20and%20Subtraction/README.md)
+  - [0593.有效的正方形](/solution/0500-0599/0593.Valid%20Square/README.md)
+  - [0594.最长和谐子序列](/solution/0500-0599/0594.Longest%20Harmonious%20Subsequence/README.md)
+  - [0595.大的国家](/solution/0500-0599/0595.Big%20Countries/README.md)
+  - [0596.超过5名学生的课](/solution/0500-0599/0596.Classes%20More%20Than%205%20Students/README.md)
+  - [0597.好友申请 I：总体通过率](/solution/0500-0599/0597.Friend%20Requests%20I%20Overall%20Acceptance%20Rate/README.md)
+  - [0598.范围求和 II](/solution/0500-0599/0598.Range%20Addition%20II/README.md)
+  - [0599.两个列表的最小索引总和](/solution/0500-0599/0599.Minimum%20Index%20Sum%20of%20Two%20Lists/README.md)
 
 - 0600-0699
-  - [0600.Non-negative Integers without Consecutive Ones](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
-  - [0601.Human Traffic of Stadium](/solution/0600-0699/0601.Human%20Traffic%20of%20Stadium/README.md)
-  - [0602.Friend Requests II Who Has the Most Friends](/solution/0600-0699/0602.Friend%20Requests%20II%20Who%20Has%20the%20Most%20Friends/README.md)
-  - [0603.Consecutive Available Seats](/solution/0600-0699/0603.Consecutive%20Available%20Seats/README.md)
-  - [0604.Design Compressed String Iterator](/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README.md)
-  - [0605.Can Place Flowers](/solution/0600-0699/0605.Can%20Place%20Flowers/README.md)
-  - [0606.Construct String from Binary Tree](/solution/0600-0699/0606.Construct%20String%20from%20Binary%20Tree/README.md)
-  - [0607.Sales Person](/solution/0600-0699/0607.Sales%20Person/README.md)
-  - [0608.Tree Node](/solution/0600-0699/0608.Tree%20Node/README.md)
-  - [0609.Find Duplicate File in System](/solution/0600-0699/0609.Find%20Duplicate%20File%20in%20System/README.md)
-  - [0610.Triangle Judgement](/solution/0600-0699/0610.Triangle%20Judgement/README.md)
-  - [0611.Valid Triangle Number](/solution/0600-0699/0611.Valid%20Triangle%20Number/README.md)
-  - [0612.Shortest Distance in a Plane](/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README.md)
-  - [0613.Shortest Distance in a Line](/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README.md)
-  - [0614.Second Degree Follower](/solution/0600-0699/0614.Second%20Degree%20Follower/README.md)
-  - [0615.Average Salary Departments VS Company](/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README.md)
-  - [0616.Add Bold Tag in String](/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md)
-  - [0617.Merge Two Binary Trees](/solution/0600-0699/0617.Merge%20Two%20Binary%20Trees/README.md)
-  - [0618.Students Report By Geography](/solution/0600-0699/0618.Students%20Report%20By%20Geography/README.md)
-  - [0619.Biggest Single Number](/solution/0600-0699/0619.Biggest%20Single%20Number/README.md)
-  - [0620.Not Boring Movies](/solution/0600-0699/0620.Not%20Boring%20Movies/README.md)
-  - [0621.Task Scheduler](/solution/0600-0699/0621.Task%20Scheduler/README.md)
-  - [0622.Design Circular Queue](/solution/0600-0699/0622.Design%20Circular%20Queue/README.md)
-  - [0623.Add One Row to Tree](/solution/0600-0699/0623.Add%20One%20Row%20to%20Tree/README.md)
-  - [0624.Maximum Distance in Arrays](/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README.md)
-  - [0625.Minimum Factorization](/solution/0600-0699/0625.Minimum%20Factorization/README.md)
-  - [0626.Exchange Seats](/solution/0600-0699/0626.Exchange%20Seats/README.md)
-  - [0627.Swap Salary](/solution/0600-0699/0627.Swap%20Salary/README.md)
-  - [0628.Maximum Product of Three Numbers](/solution/0600-0699/0628.Maximum%20Product%20of%20Three%20Numbers/README.md)
-  - [0629.K Inverse Pairs Array](/solution/0600-0699/0629.K%20Inverse%20Pairs%20Array/README.md)
-  - [0630.Course Schedule III](/solution/0600-0699/0630.Course%20Schedule%20III/README.md)
-  - [0631.Design Excel Sum Formula](/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README.md)
-  - [0632.Smallest Range Covering Elements from K Lists](/solution/0600-0699/0632.Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/README.md)
-  - [0633.Sum of Square Numbers](/solution/0600-0699/0633.Sum%20of%20Square%20Numbers/README.md)
-  - [0634.Find the Derangement of An Array](/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README.md)
-  - [0635.Design Log Storage System](/solution/0600-0699/0635.Design%20Log%20Storage%20System/README.md)
-  - [0636.Exclusive Time of Functions](/solution/0600-0699/0636.Exclusive%20Time%20of%20Functions/README.md)
-  - [0637.Average of Levels in Binary Tree](/solution/0600-0699/0637.Average%20of%20Levels%20in%20Binary%20Tree/README.md)
-  - [0638.Shopping Offers](/solution/0600-0699/0638.Shopping%20Offers/README.md)
-  - [0639.Decode Ways II](/solution/0600-0699/0639.Decode%20Ways%20II/README.md)
-  - [0640.Solve the Equation](/solution/0600-0699/0640.Solve%20the%20Equation/README.md)
-  - [0641.Design Circular Deque](/solution/0600-0699/0641.Design%20Circular%20Deque/README.md)
-  - [0642.Design Search Autocomplete System](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md)
-  - [0643.Maximum Average Subarray I](/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README.md)
-  - [0644.Maximum Average Subarray II](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README.md)
-  - [0645.Set Mismatch](/solution/0600-0699/0645.Set%20Mismatch/README.md)
-  - [0646.Maximum Length of Pair Chain](/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README.md)
-  - [0647.Palindromic Substrings](/solution/0600-0699/0647.Palindromic%20Substrings/README.md)
-  - [0648.Replace Words](/solution/0600-0699/0648.Replace%20Words/README.md)
-  - [0649.Dota2 Senate](/solution/0600-0699/0649.Dota2%20Senate/README.md)
-  - [0650.2 Keys Keyboard](/solution/0600-0699/0650.2%20Keys%20Keyboard/README.md)
-  - [0651.4 Keys Keyboard](/solution/0600-0699/0651.4%20Keys%20Keyboard/README.md)
-  - [0652.Find Duplicate Subtrees](/solution/0600-0699/0652.Find%20Duplicate%20Subtrees/README.md)
-  - [0653.Two Sum IV - Input is a BST](/solution/0600-0699/0653.Two%20Sum%20IV%20-%20Input%20is%20a%20BST/README.md)
-  - [0654.Maximum Binary Tree](/solution/0600-0699/0654.Maximum%20Binary%20Tree/README.md)
-  - [0655.Print Binary Tree](/solution/0600-0699/0655.Print%20Binary%20Tree/README.md)
-  - [0656.Coin Path](/solution/0600-0699/0656.Coin%20Path/README.md)
-  - [0657.Robot Return to Origin](/solution/0600-0699/0657.Robot%20Return%20to%20Origin/README.md)
-  - [0658.Find K Closest Elements](/solution/0600-0699/0658.Find%20K%20Closest%20Elements/README.md)
-  - [0659.Split Array into Consecutive Subsequences](/solution/0600-0699/0659.Split%20Array%20into%20Consecutive%20Subsequences/README.md)
-  - [0660.Remove 9](/solution/0600-0699/0660.Remove%209/README.md)
-  - [0661.Image Smoother](/solution/0600-0699/0661.Image%20Smoother/README.md)
-  - [0662.Maximum Width of Binary Tree](/solution/0600-0699/0662.Maximum%20Width%20of%20Binary%20Tree/README.md)
-  - [0663.Equal Tree Partition](/solution/0600-0699/0663.Equal%20Tree%20Partition/README.md)
-  - [0664.Strange Printer](/solution/0600-0699/0664.Strange%20Printer/README.md)
-  - [0665.Non-decreasing Array](/solution/0600-0699/0665.Non-decreasing%20Array/README.md)
-  - [0666.Path Sum IV](/solution/0600-0699/0666.Path%20Sum%20IV/README.md)
-  - [0667.Beautiful Arrangement II](/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README.md)
-  - [0668.Kth Smallest Number in Multiplication Table](/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README.md)
-  - [0669.Trim a Binary Search Tree](/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README.md)
-  - [0670.Maximum Swap](/solution/0600-0699/0670.Maximum%20Swap/README.md)
-  - [0671.Second Minimum Node In a Binary Tree](/solution/0600-0699/0671.Second%20Minimum%20Node%20In%20a%20Binary%20Tree/README.md)
-  - [0672.Bulb Switcher II](/solution/0600-0699/0672.Bulb%20Switcher%20II/README.md)
-  - [0673.Number of Longest Increasing Subsequence](/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README.md)
-  - [0674.Longest Continuous Increasing Subsequence](/solution/0600-0699/0674.Longest%20Continuous%20Increasing%20Subsequence/README.md)
-  - [0675.Cut Off Trees for Golf Event](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md)
-  - [0676.Implement Magic Dictionary](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README.md)
-  - [0677.Map Sum Pairs](/solution/0600-0699/0677.Map%20Sum%20Pairs/README.md)
+  - [0600.不含连续1的非负整数](/solution/0600-0699/0600.Non-negative%20Integers%20without%20Consecutive%20Ones/README.md)
+  - [0601.体育馆的人流量](/solution/0600-0699/0601.Human%20Traffic%20of%20Stadium/README.md)
+  - [0602.好友申请 II ：谁有最多的好友](/solution/0600-0699/0602.Friend%20Requests%20II%20Who%20Has%20the%20Most%20Friends/README.md)
+  - [0603.连续空余座位](/solution/0600-0699/0603.Consecutive%20Available%20Seats/README.md)
+  - [0604.迭代压缩字符串](/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README.md)
+  - [0605.种花问题](/solution/0600-0699/0605.Can%20Place%20Flowers/README.md)
+  - [0606.根据二叉树创建字符串](/solution/0600-0699/0606.Construct%20String%20from%20Binary%20Tree/README.md)
+  - [0607.销售员](/solution/0600-0699/0607.Sales%20Person/README.md)
+  - [0608.树节点](/solution/0600-0699/0608.Tree%20Node/README.md)
+  - [0609.在系统中查找重复文件](/solution/0600-0699/0609.Find%20Duplicate%20File%20in%20System/README.md)
+  - [0610.判断三角形](/solution/0600-0699/0610.Triangle%20Judgement/README.md)
+  - [0611.有效三角形的个数](/solution/0600-0699/0611.Valid%20Triangle%20Number/README.md)
+  - [0612.平面上的最近距离](/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README.md)
+  - [0613.直线上的最近距离](/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README.md)
+  - [0614.二级关注者](/solution/0600-0699/0614.Second%20Degree%20Follower/README.md)
+  - [0615.平均工资：部门与公司比较](/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README.md)
+  - [0616.给字符串添加加粗标签](/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md)
+  - [0617.合并二叉树](/solution/0600-0699/0617.Merge%20Two%20Binary%20Trees/README.md)
+  - [0618.学生地理信息报告](/solution/0600-0699/0618.Students%20Report%20By%20Geography/README.md)
+  - [0619.只出现一次的最大数字](/solution/0600-0699/0619.Biggest%20Single%20Number/README.md)
+  - [0620.有趣的电影](/solution/0600-0699/0620.Not%20Boring%20Movies/README.md)
+  - [0621.任务调度器](/solution/0600-0699/0621.Task%20Scheduler/README.md)
+  - [0622.设计循环队列](/solution/0600-0699/0622.Design%20Circular%20Queue/README.md)
+  - [0623.在二叉树中增加一行](/solution/0600-0699/0623.Add%20One%20Row%20to%20Tree/README.md)
+  - [0624.数组列表中的最大距离](/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README.md)
+  - [0625.最小因式分解](/solution/0600-0699/0625.Minimum%20Factorization/README.md)
+  - [0626.换座位](/solution/0600-0699/0626.Exchange%20Seats/README.md)
+  - [0627.变更性别](/solution/0600-0699/0627.Swap%20Salary/README.md)
+  - [0628.三个数的最大乘积](/solution/0600-0699/0628.Maximum%20Product%20of%20Three%20Numbers/README.md)
+  - [0629.K个逆序对数组](/solution/0600-0699/0629.K%20Inverse%20Pairs%20Array/README.md)
+  - [0630.课程表 III](/solution/0600-0699/0630.Course%20Schedule%20III/README.md)
+  - [0631.设计 Excel 求和公式](/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README.md)
+  - [0632.最小区间](/solution/0600-0699/0632.Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/README.md)
+  - [0633.平方数之和](/solution/0600-0699/0633.Sum%20of%20Square%20Numbers/README.md)
+  - [0634.寻找数组的错位排列](/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README.md)
+  - [0635.设计日志存储系统](/solution/0600-0699/0635.Design%20Log%20Storage%20System/README.md)
+  - [0636.函数的独占时间](/solution/0600-0699/0636.Exclusive%20Time%20of%20Functions/README.md)
+  - [0637.二叉树的层平均值](/solution/0600-0699/0637.Average%20of%20Levels%20in%20Binary%20Tree/README.md)
+  - [0638.大礼包](/solution/0600-0699/0638.Shopping%20Offers/README.md)
+  - [0639.解码方法 II](/solution/0600-0699/0639.Decode%20Ways%20II/README.md)
+  - [0640.求解方程](/solution/0600-0699/0640.Solve%20the%20Equation/README.md)
+  - [0641.设计循环双端队列](/solution/0600-0699/0641.Design%20Circular%20Deque/README.md)
+  - [0642.设计搜索自动补全系统](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md)
+  - [0643.子数组最大平均数 I](/solution/0600-0699/0643.Maximum%20Average%20Subarray%20I/README.md)
+  - [0644.子数组最大平均数 II](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README.md)
+  - [0645.错误的集合](/solution/0600-0699/0645.Set%20Mismatch/README.md)
+  - [0646.最长数对链](/solution/0600-0699/0646.Maximum%20Length%20of%20Pair%20Chain/README.md)
+  - [0647.回文子串](/solution/0600-0699/0647.Palindromic%20Substrings/README.md)
+  - [0648.单词替换](/solution/0600-0699/0648.Replace%20Words/README.md)
+  - [0649.Dota2 参议院](/solution/0600-0699/0649.Dota2%20Senate/README.md)
+  - [0650.只有两个键的键盘](/solution/0600-0699/0650.2%20Keys%20Keyboard/README.md)
+  - [0651.4键键盘](/solution/0600-0699/0651.4%20Keys%20Keyboard/README.md)
+  - [0652.寻找重复的子树](/solution/0600-0699/0652.Find%20Duplicate%20Subtrees/README.md)
+  - [0653.两数之和 IV - 输入 BST](/solution/0600-0699/0653.Two%20Sum%20IV%20-%20Input%20is%20a%20BST/README.md)
+  - [0654.最大二叉树](/solution/0600-0699/0654.Maximum%20Binary%20Tree/README.md)
+  - [0655.输出二叉树](/solution/0600-0699/0655.Print%20Binary%20Tree/README.md)
+  - [0656.金币路径](/solution/0600-0699/0656.Coin%20Path/README.md)
+  - [0657.机器人能否返回原点](/solution/0600-0699/0657.Robot%20Return%20to%20Origin/README.md)
+  - [0658.找到 K 个最接近的元素](/solution/0600-0699/0658.Find%20K%20Closest%20Elements/README.md)
+  - [0659.分割数组为连续子序列](/solution/0600-0699/0659.Split%20Array%20into%20Consecutive%20Subsequences/README.md)
+  - [0660.移除 9](/solution/0600-0699/0660.Remove%209/README.md)
+  - [0661.图片平滑器](/solution/0600-0699/0661.Image%20Smoother/README.md)
+  - [0662.二叉树最大宽度](/solution/0600-0699/0662.Maximum%20Width%20of%20Binary%20Tree/README.md)
+  - [0663.均匀树划分](/solution/0600-0699/0663.Equal%20Tree%20Partition/README.md)
+  - [0664.奇怪的打印机](/solution/0600-0699/0664.Strange%20Printer/README.md)
+  - [0665.非递减数列](/solution/0600-0699/0665.Non-decreasing%20Array/README.md)
+  - [0666.路径总和 IV](/solution/0600-0699/0666.Path%20Sum%20IV/README.md)
+  - [0667.优美的排列 II](/solution/0600-0699/0667.Beautiful%20Arrangement%20II/README.md)
+  - [0668.乘法表中第k小的数](/solution/0600-0699/0668.Kth%20Smallest%20Number%20in%20Multiplication%20Table/README.md)
+  - [0669.修剪二叉搜索树](/solution/0600-0699/0669.Trim%20a%20Binary%20Search%20Tree/README.md)
+  - [0670.最大交换](/solution/0600-0699/0670.Maximum%20Swap/README.md)
+  - [0671.二叉树中第二小的节点](/solution/0600-0699/0671.Second%20Minimum%20Node%20In%20a%20Binary%20Tree/README.md)
+  - [0672.灯泡开关 Ⅱ](/solution/0600-0699/0672.Bulb%20Switcher%20II/README.md)
+  - [0673.最长递增子序列的个数](/solution/0600-0699/0673.Number%20of%20Longest%20Increasing%20Subsequence/README.md)
+  - [0674.最长连续递增序列](/solution/0600-0699/0674.Longest%20Continuous%20Increasing%20Subsequence/README.md)
+  - [0675.为高尔夫比赛砍树](/solution/0600-0699/0675.Cut%20Off%20Trees%20for%20Golf%20Event/README.md)
+  - [0676.实现一个魔法字典](/solution/0600-0699/0676.Implement%20Magic%20Dictionary/README.md)
+  - [0677.键值映射](/solution/0600-0699/0677.Map%20Sum%20Pairs/README.md)
   - [0678.Valid Parenthesis String](/solution/0600-0699/0678.Valid%20Parenthesis%20String/README.md)
-  - [0679.24 Game](/solution/0600-0699/0679.24%20Game/README.md)
-  - [0680.Valid Palindrome II](/solution/0600-0699/0680.Valid%20Palindrome%20II/README.md)
-  - [0681.Next Closest Time](/solution/0600-0699/0681.Next%20Closest%20Time/README.md)
-  - [0682.Baseball Game](/solution/0600-0699/0682.Baseball%20Game/README.md)
-  - [0683.K Empty Slots](/solution/0600-0699/0683.K%20Empty%20Slots/README.md)
-  - [0684.Redundant Connection](/solution/0600-0699/0684.Redundant%20Connection/README.md)
-  - [0685.Redundant Connection II](/solution/0600-0699/0685.Redundant%20Connection%20II/README.md)
-  - [0686.Repeated String Match](/solution/0600-0699/0686.Repeated%20String%20Match/README.md)
-  - [0687.Longest Univalue Path](/solution/0600-0699/0687.Longest%20Univalue%20Path/README.md)
-  - [0688.Knight Probability in Chessboard](/solution/0600-0699/0688.Knight%20Probability%20in%20Chessboard/README.md)
-  - [0689.Maximum Sum of 3 Non-Overlapping Subarrays](/solution/0600-0699/0689.Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays/README.md)
-  - [0690.Employee Importance](/solution/0600-0699/0690.Employee%20Importance/README.md)
-  - [0691.Stickers to Spell Word](/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README.md)
-  - [0692.Top K Frequent Words](/solution/0600-0699/0692.Top%20K%20Frequent%20Words/README.md)
-  - [0693.Binary Number with Alternating Bits](/solution/0600-0699/0693.Binary%20Number%20with%20Alternating%20Bits/README.md)
-  - [0694.Number of Distinct Islands](/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/README.md)
-  - [0695.Max Area of Island](/solution/0600-0699/0695.Max%20Area%20of%20Island/README.md)
-  - [0696.Count Binary Substrings](/solution/0600-0699/0696.Count%20Binary%20Substrings/README.md)
-  - [0697.Degree of an Array](/solution/0600-0699/0697.Degree%20of%20an%20Array/README.md)
-  - [0698.Partition to K Equal Sum Subsets](/solution/0600-0699/0698.Partition%20to%20K%20Equal%20Sum%20Subsets/README.md)
-  - [0699.Falling Squares](/solution/0600-0699/0699.Falling%20Squares/README.md)
+  - [0679.24 点游戏](/solution/0600-0699/0679.24%20Game/README.md)
+  - [0680.验证回文字符串 Ⅱ](/solution/0600-0699/0680.Valid%20Palindrome%20II/README.md)
+  - [0681.最近时刻](/solution/0600-0699/0681.Next%20Closest%20Time/README.md)
+  - [0682.棒球比赛](/solution/0600-0699/0682.Baseball%20Game/README.md)
+  - [0683.K 个关闭的灯泡](/solution/0600-0699/0683.K%20Empty%20Slots/README.md)
+  - [0684.冗余连接](/solution/0600-0699/0684.Redundant%20Connection/README.md)
+  - [0685.冗余连接 II](/solution/0600-0699/0685.Redundant%20Connection%20II/README.md)
+  - [0686.重复叠加字符串匹配](/solution/0600-0699/0686.Repeated%20String%20Match/README.md)
+  - [0687.最长同值路径](/solution/0600-0699/0687.Longest%20Univalue%20Path/README.md)
+  - [0688.骑士在棋盘上的概率](/solution/0600-0699/0688.Knight%20Probability%20in%20Chessboard/README.md)
+  - [0689.三个无重叠子数组的最大和](/solution/0600-0699/0689.Maximum%20Sum%20of%203%20Non-Overlapping%20Subarrays/README.md)
+  - [0690.员工的重要性](/solution/0600-0699/0690.Employee%20Importance/README.md)
+  - [0691.贴纸拼词](/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README.md)
+  - [0692.前K个高频单词](/solution/0600-0699/0692.Top%20K%20Frequent%20Words/README.md)
+  - [0693.交替位二进制数](/solution/0600-0699/0693.Binary%20Number%20with%20Alternating%20Bits/README.md)
+  - [0694.不同岛屿的数量](/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/README.md)
+  - [0695.岛屿的最大面积](/solution/0600-0699/0695.Max%20Area%20of%20Island/README.md)
+  - [0696.计数二进制子串](/solution/0600-0699/0696.Count%20Binary%20Substrings/README.md)
+  - [0697.数组的度](/solution/0600-0699/0697.Degree%20of%20an%20Array/README.md)
+  - [0698.划分为k个相等的子集](/solution/0600-0699/0698.Partition%20to%20K%20Equal%20Sum%20Subsets/README.md)
+  - [0699.掉落的方块](/solution/0600-0699/0699.Falling%20Squares/README.md)
 
 - 0700-0799
-  - [0700.Search in a Binary Search Tree](/solution/0700-0799/0700.Search%20in%20a%20Binary%20Search%20Tree/README.md)
-  - [0701.Insert into a Binary Search Tree](/solution/0700-0799/0701.Insert%20into%20a%20Binary%20Search%20Tree/README.md)
-  - [0702.Search in a Sorted Array of Unknown Size](/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README.md)
-  - [0703.Kth Largest Element in a Stream](/solution/0700-0799/0703.Kth%20Largest%20Element%20in%20a%20Stream/README.md)
-  - [0704.Binary Search](/solution/0700-0799/0704.Binary%20Search/README.md)
-  - [0705.Design HashSet](/solution/0700-0799/0705.Design%20HashSet/README.md)
-  - [0706.Design HashMap](/solution/0700-0799/0706.Design%20HashMap/README.md)
-  - [0707.Design Linked List](/solution/0700-0799/0707.Design%20Linked%20List/README.md)
-  - [0708.Insert into a Sorted Circular Linked List](/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/README.md)
-  - [0709.To Lower Case](/solution/0700-0799/0709.To%20Lower%20Case/README.md)
-  - [0710.Random Pick with Blacklist](/solution/0700-0799/0710.Random%20Pick%20with%20Blacklist/README.md)
-  - [0711.Number of Distinct Islands II](/solution/0700-0799/0711.Number%20of%20Distinct%20Islands%20II/README.md)
-  - [0712.Minimum ASCII Delete Sum for Two Strings](/solution/0700-0799/0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings/README.md)
-  - [0713.Subarray Product Less Than K](/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md)
-  - [0714.Best Time to Buy and Sell Stock with Transaction Fee](/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README.md)
-  - [0715.Range Module](/solution/0700-0799/0715.Range%20Module/README.md)
-  - [0716.Max Stack](/solution/0700-0799/0716.Max%20Stack/README.md)
-  - [0717.1-bit and 2-bit Characters](/solution/0700-0799/0717.1-bit%20and%202-bit%20Characters/README.md)
-  - [0718.Maximum Length of Repeated Subarray](/solution/0700-0799/0718.Maximum%20Length%20of%20Repeated%20Subarray/README.md)
-  - [0719.Find K-th Smallest Pair Distance](/solution/0700-0799/0719.Find%20K-th%20Smallest%20Pair%20Distance/README.md)
-  - [0720.Longest Word in Dictionary](/solution/0700-0799/0720.Longest%20Word%20in%20Dictionary/README.md)
-  - [0721.Accounts Merge](/solution/0700-0799/0721.Accounts%20Merge/README.md)
-  - [0722.Remove Comments](/solution/0700-0799/0722.Remove%20Comments/README.md)
-  - [0723.Candy Crush](/solution/0700-0799/0723.Candy%20Crush/README.md)
-  - [0724.Find Pivot Index](/solution/0700-0799/0724.Find%20Pivot%20Index/README.md)
-  - [0725.Split Linked List in Parts](/solution/0700-0799/0725.Split%20Linked%20List%20in%20Parts/README.md)
-  - [0726.Number of Atoms](/solution/0700-0799/0726.Number%20of%20Atoms/README.md)
-  - [0727.Minimum Window Subsequence](/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README.md)
-  - [0728.Self Dividing Numbers](/solution/0700-0799/0728.Self%20Dividing%20Numbers/README.md)
-  - [0729.My Calendar I](/solution/0700-0799/0729.My%20Calendar%20I/README.md)
-  - [0730.Count Different Palindromic Subsequences](/solution/0700-0799/0730.Count%20Different%20Palindromic%20Subsequences/README.md)
-  - [0731.My Calendar II](/solution/0700-0799/0731.My%20Calendar%20II/README.md)
-  - [0732.My Calendar III](/solution/0700-0799/0732.My%20Calendar%20III/README.md)
-  - [0733.Flood Fill](/solution/0700-0799/0733.Flood%20Fill/README.md)
-  - [0734.Sentence Similarity](/solution/0700-0799/0734.Sentence%20Similarity/README.md)
-  - [0735.Asteroid Collision](/solution/0700-0799/0735.Asteroid%20Collision/README.md)
-  - [0736.Parse Lisp Expression](/solution/0700-0799/0736.Parse%20Lisp%20Expression/README.md)
-  - [0737.Sentence Similarity II](/solution/0700-0799/0737.Sentence%20Similarity%20II/README.md)
-  - [0738.Monotone Increasing Digits](/solution/0700-0799/0738.Monotone%20Increasing%20Digits/README.md)
-  - [0739.Daily Temperatures](/solution/0700-0799/0739.Daily%20Temperatures/README.md)
-  - [0740.Delete and Earn](/solution/0700-0799/0740.Delete%20and%20Earn/README.md)
-  - [0741.Cherry Pickup](/solution/0700-0799/0741.Cherry%20Pickup/README.md)
-  - [0742.Closest Leaf in a Binary Tree](/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README.md)
-  - [0743.Network Delay Time](/solution/0700-0799/0743.Network%20Delay%20Time/README.md)
-  - [0744.Find Smallest Letter Greater Than Target](/solution/0700-0799/0744.Find%20Smallest%20Letter%20Greater%20Than%20Target/README.md)
-  - [0745.Prefix and Suffix Search](/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README.md)
-  - [0746.Min Cost Climbing Stairs](/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README.md)
-  - [0747.Largest Number At Least Twice of Others](/solution/0700-0799/0747.Largest%20Number%20At%20Least%20Twice%20of%20Others/README.md)
-  - [0748.Shortest Completing Word](/solution/0700-0799/0748.Shortest%20Completing%20Word/README.md)
-  - [0749.Contain Virus](/solution/0700-0799/0749.Contain%20Virus/README.md)
-  - [0750.Number Of Corner Rectangles](/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README.md)
-  - [0751.IP to CIDR](/solution/0700-0799/0751.IP%20to%20CIDR/README.md)
-  - [0752.Open the Lock](/solution/0700-0799/0752.Open%20the%20Lock/README.md)
-  - [0753.Cracking the Safe](/solution/0700-0799/0753.Cracking%20the%20Safe/README.md)
-  - [0754.Reach a Number](/solution/0700-0799/0754.Reach%20a%20Number/README.md)
-  - [0755.Pour Water](/solution/0700-0799/0755.Pour%20Water/README.md)
-  - [0756.Pyramid Transition Matrix](/solution/0700-0799/0756.Pyramid%20Transition%20Matrix/README.md)
-  - [0757.Set Intersection Size At Least Two](/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README.md)
-  - [0758.Bold Words in String](/solution/0700-0799/0758.Bold%20Words%20in%20String/README.md)
-  - [0759.Employee Free Time](/solution/0700-0799/0759.Employee%20Free%20Time/README.md)
-  - [0760.Find Anagram Mappings](/solution/0700-0799/0760.Find%20Anagram%20Mappings/README.md)
-  - [0761.Special Binary String](/solution/0700-0799/0761.Special%20Binary%20String/README.md)
-  - [0762.Prime Number of Set Bits in Binary Representation](/solution/0700-0799/0762.Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation/README.md)
-  - [0763.Partition Labels](/solution/0700-0799/0763.Partition%20Labels/README.md)
-  - [0764.Largest Plus Sign](/solution/0700-0799/0764.Largest%20Plus%20Sign/README.md)
-  - [0765.Couples Holding Hands](/solution/0700-0799/0765.Couples%20Holding%20Hands/README.md)
-  - [0766.Toeplitz Matrix](/solution/0700-0799/0766.Toeplitz%20Matrix/README.md)
-  - [0767.Reorganize String](/solution/0700-0799/0767.Reorganize%20String/README.md)
-  - [0768.Max Chunks To Make Sorted II](/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README.md)
-  - [0769.Max Chunks To Make Sorted](/solution/0700-0799/0769.Max%20Chunks%20To%20Make%20Sorted/README.md)
-  - [0770.Basic Calculator IV](/solution/0700-0799/0770.Basic%20Calculator%20IV/README.md)
-  - [0771.Jewels and Stones](/solution/0700-0799/0771.Jewels%20and%20Stones/README.md)
-  - [0772.Basic Calculator III](/solution/0700-0799/0772.Basic%20Calculator%20III/README.md)
-  - [0773.Sliding Puzzle](/solution/0700-0799/0773.Sliding%20Puzzle/README.md)
-  - [0774.Minimize Max Distance to Gas Station](/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README.md)
-  - [0775.Global and Local Inversions](/solution/0700-0799/0775.Global%20and%20Local%20Inversions/README.md)
-  - [0776.Split BST](/solution/0700-0799/0776.Split%20BST/README.md)
-  - [0777.Swap Adjacent in LR String](/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README.md)
-  - [0778.Swim in Rising Water](/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README.md)
-  - [0779.K-th Symbol in Grammar](/solution/0700-0799/0779.K-th%20Symbol%20in%20Grammar/README.md)
-  - [0780.Reaching Points](/solution/0700-0799/0780.Reaching%20Points/README.md)
-  - [0781.Rabbits in Forest](/solution/0700-0799/0781.Rabbits%20in%20Forest/README.md)
-  - [0782.Transform to Chessboard](/solution/0700-0799/0782.Transform%20to%20Chessboard/README.md)
-  - [0783.Minimum Distance Between BST Nodes](/solution/0700-0799/0783.Minimum%20Distance%20Between%20BST%20Nodes/README.md)
-  - [0784.Letter Case Permutation](/solution/0700-0799/0784.Letter%20Case%20Permutation/README.md)
-  - [0785.Is Graph Bipartite](/solution/0700-0799/0785.Is%20Graph%20Bipartite/README.md)
-  - [0786.K-th Smallest Prime Fraction](/solution/0700-0799/0786.K-th%20Smallest%20Prime%20Fraction/README.md)
-  - [0787.Cheapest Flights Within K Stops](/solution/0700-0799/0787.Cheapest%20Flights%20Within%20K%20Stops/README.md)
-  - [0788.Rotated Digits](/solution/0700-0799/0788.Rotated%20Digits/README.md)
-  - [0789.Escape The Ghosts](/solution/0700-0799/0789.Escape%20The%20Ghosts/README.md)
-  - [0790.Domino and Tromino Tiling](/solution/0700-0799/0790.Domino%20and%20Tromino%20Tiling/README.md)
-  - [0791.Custom Sort String](/solution/0700-0799/0791.Custom%20Sort%20String/README.md)
-  - [0792.Number of Matching Subsequences](/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README.md)
-  - [0793.Preimage Size of Factorial Zeroes Function](/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README.md)
-  - [0794.Valid Tic-Tac-Toe State](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README.md)
-  - [0795.Number of Subarrays with Bounded Maximum](/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README.md)
-  - [0796.Rotate String](/solution/0700-0799/0796.Rotate%20String/README.md)
-  - [0797.All Paths From Source to Target](/solution/0700-0799/0797.All%20Paths%20From%20Source%20to%20Target/README.md)
-  - [0798.Smallest Rotation with Highest Score](/solution/0700-0799/0798.Smallest%20Rotation%20with%20Highest%20Score/README.md)
-  - [0799.Champagne Tower](/solution/0700-0799/0799.Champagne%20Tower/README.md)
+  - [0700.二叉搜索树中的搜索](/solution/0700-0799/0700.Search%20in%20a%20Binary%20Search%20Tree/README.md)
+  - [0701.二叉搜索树中的插入操作](/solution/0700-0799/0701.Insert%20into%20a%20Binary%20Search%20Tree/README.md)
+  - [0702.搜索长度未知的有序数组](/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README.md)
+  - [0703.数据流中的第 K 大元素](/solution/0700-0799/0703.Kth%20Largest%20Element%20in%20a%20Stream/README.md)
+  - [0704.二分查找](/solution/0700-0799/0704.Binary%20Search/README.md)
+  - [0705.设计哈希集合](/solution/0700-0799/0705.Design%20HashSet/README.md)
+  - [0706.设计哈希映射](/solution/0700-0799/0706.Design%20HashMap/README.md)
+  - [0707.设计链表](/solution/0700-0799/0707.Design%20Linked%20List/README.md)
+  - [0708.循环有序列表的插入](/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/README.md)
+  - [0709.转换成小写字母](/solution/0700-0799/0709.To%20Lower%20Case/README.md)
+  - [0710.黑名单中的随机数](/solution/0700-0799/0710.Random%20Pick%20with%20Blacklist/README.md)
+  - [0711.不同岛屿的数量 II](/solution/0700-0799/0711.Number%20of%20Distinct%20Islands%20II/README.md)
+  - [0712.两个字符串的最小ASCII删除和](/solution/0700-0799/0712.Minimum%20ASCII%20Delete%20Sum%20for%20Two%20Strings/README.md)
+  - [0713.乘积小于K的子数组](/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md)
+  - [0714.买卖股票的最佳时机含手续费](/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README.md)
+  - [0715.Range 模块](/solution/0700-0799/0715.Range%20Module/README.md)
+  - [0716.最大栈](/solution/0700-0799/0716.Max%20Stack/README.md)
+  - [0717.1 比特与 2 比特字符](/solution/0700-0799/0717.1-bit%20and%202-bit%20Characters/README.md)
+  - [0718.最长重复子数组](/solution/0700-0799/0718.Maximum%20Length%20of%20Repeated%20Subarray/README.md)
+  - [0719.找出第 k 小的距离对](/solution/0700-0799/0719.Find%20K-th%20Smallest%20Pair%20Distance/README.md)
+  - [0720.词典中最长的单词](/solution/0700-0799/0720.Longest%20Word%20in%20Dictionary/README.md)
+  - [0721.账户合并](/solution/0700-0799/0721.Accounts%20Merge/README.md)
+  - [0722.删除注释](/solution/0700-0799/0722.Remove%20Comments/README.md)
+  - [0723.粉碎糖果](/solution/0700-0799/0723.Candy%20Crush/README.md)
+  - [0724.寻找数组的中心下标](/solution/0700-0799/0724.Find%20Pivot%20Index/README.md)
+  - [0725.分隔链表](/solution/0700-0799/0725.Split%20Linked%20List%20in%20Parts/README.md)
+  - [0726.原子的数量](/solution/0700-0799/0726.Number%20of%20Atoms/README.md)
+  - [0727.最小窗口子序列](/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README.md)
+  - [0728.自除数](/solution/0700-0799/0728.Self%20Dividing%20Numbers/README.md)
+  - [0729.我的日程安排表 I](/solution/0700-0799/0729.My%20Calendar%20I/README.md)
+  - [0730.统计不同回文子序列](/solution/0700-0799/0730.Count%20Different%20Palindromic%20Subsequences/README.md)
+  - [0731.我的日程安排表 II](/solution/0700-0799/0731.My%20Calendar%20II/README.md)
+  - [0732.我的日程安排表 III](/solution/0700-0799/0732.My%20Calendar%20III/README.md)
+  - [0733.图像渲染](/solution/0700-0799/0733.Flood%20Fill/README.md)
+  - [0734.句子相似性](/solution/0700-0799/0734.Sentence%20Similarity/README.md)
+  - [0735.行星碰撞](/solution/0700-0799/0735.Asteroid%20Collision/README.md)
+  - [0736.Lisp 语法解析](/solution/0700-0799/0736.Parse%20Lisp%20Expression/README.md)
+  - [0737.句子相似性 II](/solution/0700-0799/0737.Sentence%20Similarity%20II/README.md)
+  - [0738.单调递增的数字](/solution/0700-0799/0738.Monotone%20Increasing%20Digits/README.md)
+  - [0739.每日温度](/solution/0700-0799/0739.Daily%20Temperatures/README.md)
+  - [0740.删除并获得点数](/solution/0700-0799/0740.Delete%20and%20Earn/README.md)
+  - [0741.摘樱桃](/solution/0700-0799/0741.Cherry%20Pickup/README.md)
+  - [0742.二叉树最近的叶节点](/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README.md)
+  - [0743.网络延迟时间](/solution/0700-0799/0743.Network%20Delay%20Time/README.md)
+  - [0744.寻找比目标字母大的最小字母](/solution/0700-0799/0744.Find%20Smallest%20Letter%20Greater%20Than%20Target/README.md)
+  - [0745.前缀和后缀搜索](/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README.md)
+  - [0746.使用最小花费爬楼梯](/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README.md)
+  - [0747.至少是其他数字两倍的最大数](/solution/0700-0799/0747.Largest%20Number%20At%20Least%20Twice%20of%20Others/README.md)
+  - [0748.最短补全词](/solution/0700-0799/0748.Shortest%20Completing%20Word/README.md)
+  - [0749.隔离病毒](/solution/0700-0799/0749.Contain%20Virus/README.md)
+  - [0750.角矩形的数量](/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README.md)
+  - [0751.IP 到 CIDR](/solution/0700-0799/0751.IP%20to%20CIDR/README.md)
+  - [0752.打开转盘锁](/solution/0700-0799/0752.Open%20the%20Lock/README.md)
+  - [0753.破解保险箱](/solution/0700-0799/0753.Cracking%20the%20Safe/README.md)
+  - [0754.到达终点数字](/solution/0700-0799/0754.Reach%20a%20Number/README.md)
+  - [0755.倒水](/solution/0700-0799/0755.Pour%20Water/README.md)
+  - [0756.金字塔转换矩阵](/solution/0700-0799/0756.Pyramid%20Transition%20Matrix/README.md)
+  - [0757.设置交集大小至少为2](/solution/0700-0799/0757.Set%20Intersection%20Size%20At%20Least%20Two/README.md)
+  - [0758.字符串中的加粗单词](/solution/0700-0799/0758.Bold%20Words%20in%20String/README.md)
+  - [0759.员工空闲时间](/solution/0700-0799/0759.Employee%20Free%20Time/README.md)
+  - [0760.找出变位映射](/solution/0700-0799/0760.Find%20Anagram%20Mappings/README.md)
+  - [0761.特殊的二进制序列](/solution/0700-0799/0761.Special%20Binary%20String/README.md)
+  - [0762.二进制表示中质数个计算置位](/solution/0700-0799/0762.Prime%20Number%20of%20Set%20Bits%20in%20Binary%20Representation/README.md)
+  - [0763.划分字母区间](/solution/0700-0799/0763.Partition%20Labels/README.md)
+  - [0764.最大加号标志](/solution/0700-0799/0764.Largest%20Plus%20Sign/README.md)
+  - [0765.情侣牵手](/solution/0700-0799/0765.Couples%20Holding%20Hands/README.md)
+  - [0766.托普利茨矩阵](/solution/0700-0799/0766.Toeplitz%20Matrix/README.md)
+  - [0767.重构字符串](/solution/0700-0799/0767.Reorganize%20String/README.md)
+  - [0768.最多能完成排序的块 II](/solution/0700-0799/0768.Max%20Chunks%20To%20Make%20Sorted%20II/README.md)
+  - [0769.最多能完成排序的块](/solution/0700-0799/0769.Max%20Chunks%20To%20Make%20Sorted/README.md)
+  - [0770.基本计算器 IV](/solution/0700-0799/0770.Basic%20Calculator%20IV/README.md)
+  - [0771.宝石与石头](/solution/0700-0799/0771.Jewels%20and%20Stones/README.md)
+  - [0772.基本计算器 III](/solution/0700-0799/0772.Basic%20Calculator%20III/README.md)
+  - [0773.滑动谜题](/solution/0700-0799/0773.Sliding%20Puzzle/README.md)
+  - [0774.最小化去加油站的最大距离](/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README.md)
+  - [0775.全局倒置与局部倒置](/solution/0700-0799/0775.Global%20and%20Local%20Inversions/README.md)
+  - [0776.拆分二叉搜索树](/solution/0700-0799/0776.Split%20BST/README.md)
+  - [0777.在LR字符串中交换相邻字符](/solution/0700-0799/0777.Swap%20Adjacent%20in%20LR%20String/README.md)
+  - [0778.水位上升的泳池中游泳](/solution/0700-0799/0778.Swim%20in%20Rising%20Water/README.md)
+  - [0779.第K个语法符号](/solution/0700-0799/0779.K-th%20Symbol%20in%20Grammar/README.md)
+  - [0780.到达终点](/solution/0700-0799/0780.Reaching%20Points/README.md)
+  - [0781.森林中的兔子](/solution/0700-0799/0781.Rabbits%20in%20Forest/README.md)
+  - [0782.变为棋盘](/solution/0700-0799/0782.Transform%20to%20Chessboard/README.md)
+  - [0783.二叉搜索树节点最小距离](/solution/0700-0799/0783.Minimum%20Distance%20Between%20BST%20Nodes/README.md)
+  - [0784.字母大小写全排列](/solution/0700-0799/0784.Letter%20Case%20Permutation/README.md)
+  - [0785.判断二分图](/solution/0700-0799/0785.Is%20Graph%20Bipartite/README.md)
+  - [0786.第 K 个最小的素数分数](/solution/0700-0799/0786.K-th%20Smallest%20Prime%20Fraction/README.md)
+  - [0787.K 站中转内最便宜的航班](/solution/0700-0799/0787.Cheapest%20Flights%20Within%20K%20Stops/README.md)
+  - [0788.旋转数字](/solution/0700-0799/0788.Rotated%20Digits/README.md)
+  - [0789.逃脱阻碍者](/solution/0700-0799/0789.Escape%20The%20Ghosts/README.md)
+  - [0790.多米诺和托米诺平铺](/solution/0700-0799/0790.Domino%20and%20Tromino%20Tiling/README.md)
+  - [0791.自定义字符串排序](/solution/0700-0799/0791.Custom%20Sort%20String/README.md)
+  - [0792.匹配子序列的单词数](/solution/0700-0799/0792.Number%20of%20Matching%20Subsequences/README.md)
+  - [0793.阶乘函数后 K 个零](/solution/0700-0799/0793.Preimage%20Size%20of%20Factorial%20Zeroes%20Function/README.md)
+  - [0794.有效的井字游戏](/solution/0700-0799/0794.Valid%20Tic-Tac-Toe%20State/README.md)
+  - [0795.区间子数组个数](/solution/0700-0799/0795.Number%20of%20Subarrays%20with%20Bounded%20Maximum/README.md)
+  - [0796.旋转字符串](/solution/0700-0799/0796.Rotate%20String/README.md)
+  - [0797.所有可能的路径](/solution/0700-0799/0797.All%20Paths%20From%20Source%20to%20Target/README.md)
+  - [0798.得分最高的最小轮调](/solution/0700-0799/0798.Smallest%20Rotation%20with%20Highest%20Score/README.md)
+  - [0799.香槟塔](/solution/0700-0799/0799.Champagne%20Tower/README.md)
 
 - 0800-0899
-  - [0800.Similar RGB Color](/solution/0800-0899/0800.Similar%20RGB%20Color/README.md)
-  - [0801.Minimum Swaps To Make Sequences Increasing](/solution/0800-0899/0801.Minimum%20Swaps%20To%20Make%20Sequences%20Increasing/README.md)
-  - [0802.Find Eventual Safe States](/solution/0800-0899/0802.Find%20Eventual%20Safe%20States/README.md)
-  - [0803.Bricks Falling When Hit](/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README.md)
-  - [0804.Unique Morse Code Words](/solution/0800-0899/0804.Unique%20Morse%20Code%20Words/README.md)
-  - [0805.Split Array With Same Average](/solution/0800-0899/0805.Split%20Array%20With%20Same%20Average/README.md)
-  - [0806.Number of Lines To Write String](/solution/0800-0899/0806.Number%20of%20Lines%20To%20Write%20String/README.md)
-  - [0807.Max Increase to Keep City Skyline](/solution/0800-0899/0807.Max%20Increase%20to%20Keep%20City%20Skyline/README.md)
-  - [0808.Soup Servings](/solution/0800-0899/0808.Soup%20Servings/README.md)
-  - [0809.Expressive Words](/solution/0800-0899/0809.Expressive%20Words/README.md)
-  - [0810.Chalkboard XOR Game](/solution/0800-0899/0810.Chalkboard%20XOR%20Game/README.md)
-  - [0811.Subdomain Visit Count](/solution/0800-0899/0811.Subdomain%20Visit%20Count/README.md)
-  - [0812.Largest Triangle Area](/solution/0800-0899/0812.Largest%20Triangle%20Area/README.md)
-  - [0813.Largest Sum of Averages](/solution/0800-0899/0813.Largest%20Sum%20of%20Averages/README.md)
-  - [0814.Binary Tree Pruning](/solution/0800-0899/0814.Binary%20Tree%20Pruning/README.md)
-  - [0815.Bus Routes](/solution/0800-0899/0815.Bus%20Routes/README.md)
-  - [0816.Ambiguous Coordinates](/solution/0800-0899/0816.Ambiguous%20Coordinates/README.md)
-  - [0817.Linked List Components](/solution/0800-0899/0817.Linked%20List%20Components/README.md)
-  - [0818.Race Car](/solution/0800-0899/0818.Race%20Car/README.md)
-  - [0819.Most Common Word](/solution/0800-0899/0819.Most%20Common%20Word/README.md)
-  - [0820.Short Encoding of Words](/solution/0800-0899/0820.Short%20Encoding%20of%20Words/README.md)
-  - [0821.Shortest Distance to a Character](/solution/0800-0899/0821.Shortest%20Distance%20to%20a%20Character/README.md)
-  - [0822.Card Flipping Game](/solution/0800-0899/0822.Card%20Flipping%20Game/README.md)
-  - [0823.Binary Trees With Factors](/solution/0800-0899/0823.Binary%20Trees%20With%20Factors/README.md)
-  - [0824.Goat Latin](/solution/0800-0899/0824.Goat%20Latin/README.md)
-  - [0825.Friends Of Appropriate Ages](/solution/0800-0899/0825.Friends%20Of%20Appropriate%20Ages/README.md)
-  - [0826.Most Profit Assigning Work](/solution/0800-0899/0826.Most%20Profit%20Assigning%20Work/README.md)
-  - [0827.Making A Large Island](/solution/0800-0899/0827.Making%20A%20Large%20Island/README.md)
-  - [0828.Count Unique Characters of All Substrings of a Given String](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README.md)
-  - [0829.Consecutive Numbers Sum](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README.md)
-  - [0830.Positions of Large Groups](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README.md)
-  - [0831.Masking Personal Information](/solution/0800-0899/0831.Masking%20Personal%20Information/README.md)
-  - [0832.Flipping an Image](/solution/0800-0899/0832.Flipping%20an%20Image/README.md)
-  - [0833.Find And Replace in String](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README.md)
-  - [0834.Sum of Distances in Tree](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README.md)
-  - [0835.Image Overlap](/solution/0800-0899/0835.Image%20Overlap/README.md)
-  - [0836.Rectangle Overlap](/solution/0800-0899/0836.Rectangle%20Overlap/README.md)
-  - [0837.New 21 Game](/solution/0800-0899/0837.New%2021%20Game/README.md)
-  - [0838.Push Dominoes](/solution/0800-0899/0838.Push%20Dominoes/README.md)
-  - [0839.Similar String Groups](/solution/0800-0899/0839.Similar%20String%20Groups/README.md)
-  - [0840.Magic Squares In Grid](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README.md)
-  - [0841.Keys and Rooms](/solution/0800-0899/0841.Keys%20and%20Rooms/README.md)
-  - [0842.Split Array into Fibonacci Sequence](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README.md)
-  - [0843.Guess the Word](/solution/0800-0899/0843.Guess%20the%20Word/README.md)
-  - [0844.Backspace String Compare](/solution/0800-0899/0844.Backspace%20String%20Compare/README.md)
-  - [0845.Longest Mountain in Array](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README.md)
-  - [0846.Hand of Straights](/solution/0800-0899/0846.Hand%20of%20Straights/README.md)
-  - [0847.Shortest Path Visiting All Nodes](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README.md)
-  - [0848.Shifting Letters](/solution/0800-0899/0848.Shifting%20Letters/README.md)
-  - [0849.Maximize Distance to Closest Person](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README.md)
-  - [0850.Rectangle Area II](/solution/0800-0899/0850.Rectangle%20Area%20II/README.md)
-  - [0851.Loud and Rich](/solution/0800-0899/0851.Loud%20and%20Rich/README.md)
-  - [0852.Peak Index in a Mountain Array](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README.md)
-  - [0853.Car Fleet](/solution/0800-0899/0853.Car%20Fleet/README.md)
-  - [0854.K-Similar Strings](/solution/0800-0899/0854.K-Similar%20Strings/README.md)
-  - [0855.Exam Room](/solution/0800-0899/0855.Exam%20Room/README.md)
-  - [0856.Score of Parentheses](/solution/0800-0899/0856.Score%20of%20Parentheses/README.md)
-  - [0857.Minimum Cost to Hire K Workers](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README.md)
-  - [0858.Mirror Reflection](/solution/0800-0899/0858.Mirror%20Reflection/README.md)
-  - [0859.Buddy Strings](/solution/0800-0899/0859.Buddy%20Strings/README.md)
-  - [0860.Lemonade Change](/solution/0800-0899/0860.Lemonade%20Change/README.md)
-  - [0861.Score After Flipping Matrix](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README.md)
-  - [0862.Shortest Subarray with Sum at Least K](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md)
-  - [0863.All Nodes Distance K in Binary Tree](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README.md)
-  - [0864.Shortest Path to Get All Keys](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README.md)
-  - [0865.Smallest Subtree with all the Deepest Nodes](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README.md)
-  - [0866.Prime Palindrome](/solution/0800-0899/0866.Prime%20Palindrome/README.md)
-  - [0867.Transpose Matrix](/solution/0800-0899/0867.Transpose%20Matrix/README.md)
-  - [0868.Binary Gap](/solution/0800-0899/0868.Binary%20Gap/README.md)
-  - [0869.Reordered Power of 2](/solution/0800-0899/0869.Reordered%20Power%20of%202/README.md)
-  - [0870.Advantage Shuffle](/solution/0800-0899/0870.Advantage%20Shuffle/README.md)
-  - [0871.Minimum Number of Refueling Stops](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README.md)
-  - [0872.Leaf-Similar Trees](/solution/0800-0899/0872.Leaf-Similar%20Trees/README.md)
-  - [0873.Length of Longest Fibonacci Subsequence](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README.md)
-  - [0874.Walking Robot Simulation](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README.md)
-  - [0875.Koko Eating Bananas](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README.md)
-  - [0876.Middle of the Linked List](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README.md)
-  - [0877.Stone Game](/solution/0800-0899/0877.Stone%20Game/README.md)
-  - [0878.Nth Magical Number](/solution/0800-0899/0878.Nth%20Magical%20Number/README.md)
-  - [0879.Profitable Schemes](/solution/0800-0899/0879.Profitable%20Schemes/README.md)
-  - [0880.Decoded String at Index](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README.md)
-  - [0881.Boats to Save People](/solution/0800-0899/0881.Boats%20to%20Save%20People/README.md)
-  - [0882.Reachable Nodes In Subdivided Graph](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README.md)
-  - [0883.Projection Area of 3D Shapes](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README.md)
-  - [0884.Uncommon Words from Two Sentences](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README.md)
-  - [0885.Spiral Matrix III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README.md)
-  - [0886.Possible Bipartition](/solution/0800-0899/0886.Possible%20Bipartition/README.md)
-  - [0887.Super Egg Drop](/solution/0800-0899/0887.Super%20Egg%20Drop/README.md)
-  - [0888.Fair Candy Swap](/solution/0800-0899/0888.Fair%20Candy%20Swap/README.md)
-  - [0889.Construct Binary Tree from Preorder and Postorder Traversal](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README.md)
-  - [0890.Find and Replace Pattern](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README.md)
-  - [0891.Sum of Subsequence Widths](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README.md)
-  - [0892.Surface Area of 3D Shapes](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README.md)
-  - [0893.Groups of Special-Equivalent Strings](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README.md)
-  - [0894.All Possible Full Binary Trees](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README.md)
-  - [0895.Maximum Frequency Stack](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README.md)
-  - [0896.Monotonic Array](/solution/0800-0899/0896.Monotonic%20Array/README.md)
-  - [0897.Increasing Order Search Tree](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README.md)
-  - [0898.Bitwise ORs of Subarrays](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README.md)
-  - [0899.Orderly Queue](/solution/0800-0899/0899.Orderly%20Queue/README.md)
+  - [0800.相似 RGB 颜色](/solution/0800-0899/0800.Similar%20RGB%20Color/README.md)
+  - [0801.使序列递增的最小交换次数](/solution/0800-0899/0801.Minimum%20Swaps%20To%20Make%20Sequences%20Increasing/README.md)
+  - [0802.找到最终的安全状态](/solution/0800-0899/0802.Find%20Eventual%20Safe%20States/README.md)
+  - [0803.打砖块](/solution/0800-0899/0803.Bricks%20Falling%20When%20Hit/README.md)
+  - [0804.唯一摩尔斯密码词](/solution/0800-0899/0804.Unique%20Morse%20Code%20Words/README.md)
+  - [0805.数组的均值分割](/solution/0800-0899/0805.Split%20Array%20With%20Same%20Average/README.md)
+  - [0806.写字符串需要的行数](/solution/0800-0899/0806.Number%20of%20Lines%20To%20Write%20String/README.md)
+  - [0807.保持城市天际线](/solution/0800-0899/0807.Max%20Increase%20to%20Keep%20City%20Skyline/README.md)
+  - [0808.分汤](/solution/0800-0899/0808.Soup%20Servings/README.md)
+  - [0809.情感丰富的文字](/solution/0800-0899/0809.Expressive%20Words/README.md)
+  - [0810.黑板异或游戏](/solution/0800-0899/0810.Chalkboard%20XOR%20Game/README.md)
+  - [0811.子域名访问计数](/solution/0800-0899/0811.Subdomain%20Visit%20Count/README.md)
+  - [0812.最大三角形面积](/solution/0800-0899/0812.Largest%20Triangle%20Area/README.md)
+  - [0813.最大平均值和的分组](/solution/0800-0899/0813.Largest%20Sum%20of%20Averages/README.md)
+  - [0814.二叉树剪枝](/solution/0800-0899/0814.Binary%20Tree%20Pruning/README.md)
+  - [0815.公交路线](/solution/0800-0899/0815.Bus%20Routes/README.md)
+  - [0816.模糊坐标](/solution/0800-0899/0816.Ambiguous%20Coordinates/README.md)
+  - [0817.链表组件](/solution/0800-0899/0817.Linked%20List%20Components/README.md)
+  - [0818.赛车](/solution/0800-0899/0818.Race%20Car/README.md)
+  - [0819.最常见的单词](/solution/0800-0899/0819.Most%20Common%20Word/README.md)
+  - [0820.单词的压缩编码](/solution/0800-0899/0820.Short%20Encoding%20of%20Words/README.md)
+  - [0821.字符的最短距离](/solution/0800-0899/0821.Shortest%20Distance%20to%20a%20Character/README.md)
+  - [0822.翻转卡片游戏](/solution/0800-0899/0822.Card%20Flipping%20Game/README.md)
+  - [0823.带因子的二叉树](/solution/0800-0899/0823.Binary%20Trees%20With%20Factors/README.md)
+  - [0824.山羊拉丁文](/solution/0800-0899/0824.Goat%20Latin/README.md)
+  - [0825.适龄的朋友](/solution/0800-0899/0825.Friends%20Of%20Appropriate%20Ages/README.md)
+  - [0826.安排工作以达到最大收益](/solution/0800-0899/0826.Most%20Profit%20Assigning%20Work/README.md)
+  - [0827.最大人工岛](/solution/0800-0899/0827.Making%20A%20Large%20Island/README.md)
+  - [0828.统计子串中的唯一字符](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README.md)
+  - [0829.连续整数求和](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README.md)
+  - [0830.较大分组的位置](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README.md)
+  - [0831.隐藏个人信息](/solution/0800-0899/0831.Masking%20Personal%20Information/README.md)
+  - [0832.翻转图像](/solution/0800-0899/0832.Flipping%20an%20Image/README.md)
+  - [0833.字符串中的查找与替换](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README.md)
+  - [0834.树中距离之和](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README.md)
+  - [0835.图像重叠](/solution/0800-0899/0835.Image%20Overlap/README.md)
+  - [0836.矩形重叠](/solution/0800-0899/0836.Rectangle%20Overlap/README.md)
+  - [0837.新 21 点](/solution/0800-0899/0837.New%2021%20Game/README.md)
+  - [0838.推多米诺](/solution/0800-0899/0838.Push%20Dominoes/README.md)
+  - [0839.相似字符串组](/solution/0800-0899/0839.Similar%20String%20Groups/README.md)
+  - [0840.矩阵中的幻方](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README.md)
+  - [0841.钥匙和房间](/solution/0800-0899/0841.Keys%20and%20Rooms/README.md)
+  - [0842.将数组拆分成斐波那契序列](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README.md)
+  - [0843.猜猜这个单词](/solution/0800-0899/0843.Guess%20the%20Word/README.md)
+  - [0844.比较含退格的字符串](/solution/0800-0899/0844.Backspace%20String%20Compare/README.md)
+  - [0845.数组中的最长山脉](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README.md)
+  - [0846.一手顺子](/solution/0800-0899/0846.Hand%20of%20Straights/README.md)
+  - [0847.访问所有节点的最短路径](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README.md)
+  - [0848.字母移位](/solution/0800-0899/0848.Shifting%20Letters/README.md)
+  - [0849.到最近的人的最大距离](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README.md)
+  - [0850.矩形面积 II](/solution/0800-0899/0850.Rectangle%20Area%20II/README.md)
+  - [0851.喧闹和富有](/solution/0800-0899/0851.Loud%20and%20Rich/README.md)
+  - [0852.山脉数组的峰顶索引](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README.md)
+  - [0853.车队](/solution/0800-0899/0853.Car%20Fleet/README.md)
+  - [0854.相似度为 K 的字符串](/solution/0800-0899/0854.K-Similar%20Strings/README.md)
+  - [0855.考场就座](/solution/0800-0899/0855.Exam%20Room/README.md)
+  - [0856.括号的分数](/solution/0800-0899/0856.Score%20of%20Parentheses/README.md)
+  - [0857.雇佣 K 名工人的最低成本](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README.md)
+  - [0858.镜面反射](/solution/0800-0899/0858.Mirror%20Reflection/README.md)
+  - [0859.亲密字符串](/solution/0800-0899/0859.Buddy%20Strings/README.md)
+  - [0860.柠檬水找零](/solution/0800-0899/0860.Lemonade%20Change/README.md)
+  - [0861.翻转矩阵后的得分](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README.md)
+  - [0862.和至少为 K 的最短子数组](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md)
+  - [0863.二叉树中所有距离为 K 的结点](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README.md)
+  - [0864.获取所有钥匙的最短路径](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README.md)
+  - [0865.具有所有最深节点的最小子树](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README.md)
+  - [0866.回文素数](/solution/0800-0899/0866.Prime%20Palindrome/README.md)
+  - [0867.转置矩阵](/solution/0800-0899/0867.Transpose%20Matrix/README.md)
+  - [0868.二进制间距](/solution/0800-0899/0868.Binary%20Gap/README.md)
+  - [0869.重新排序得到 2 的幂](/solution/0800-0899/0869.Reordered%20Power%20of%202/README.md)
+  - [0870.优势洗牌](/solution/0800-0899/0870.Advantage%20Shuffle/README.md)
+  - [0871.最低加油次数](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README.md)
+  - [0872.叶子相似的树](/solution/0800-0899/0872.Leaf-Similar%20Trees/README.md)
+  - [0873.最长的斐波那契子序列的长度](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README.md)
+  - [0874.模拟行走机器人](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README.md)
+  - [0875.爱吃香蕉的珂珂](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README.md)
+  - [0876.链表的中间结点](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README.md)
+  - [0877.石子游戏](/solution/0800-0899/0877.Stone%20Game/README.md)
+  - [0878.第 N 个神奇数字](/solution/0800-0899/0878.Nth%20Magical%20Number/README.md)
+  - [0879.盈利计划](/solution/0800-0899/0879.Profitable%20Schemes/README.md)
+  - [0880.索引处的解码字符串](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README.md)
+  - [0881.救生艇](/solution/0800-0899/0881.Boats%20to%20Save%20People/README.md)
+  - [0882.细分图中的可到达结点](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README.md)
+  - [0883.三维形体投影面积](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README.md)
+  - [0884.两句话中的不常见单词](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README.md)
+  - [0885.螺旋矩阵 III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README.md)
+  - [0886.可能的二分法](/solution/0800-0899/0886.Possible%20Bipartition/README.md)
+  - [0887.鸡蛋掉落](/solution/0800-0899/0887.Super%20Egg%20Drop/README.md)
+  - [0888.公平的糖果交换](/solution/0800-0899/0888.Fair%20Candy%20Swap/README.md)
+  - [0889.根据前序和后序遍历构造二叉树](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README.md)
+  - [0890.查找和替换模式](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README.md)
+  - [0891.子序列宽度之和](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README.md)
+  - [0892.三维形体的表面积](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README.md)
+  - [0893.特殊等价字符串组](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README.md)
+  - [0894.所有可能的满二叉树](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README.md)
+  - [0895.最大频率栈](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README.md)
+  - [0896.单调数列](/solution/0800-0899/0896.Monotonic%20Array/README.md)
+  - [0897.递增顺序搜索树](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README.md)
+  - [0898.子数组按位或操作](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README.md)
+  - [0899.有序队列](/solution/0800-0899/0899.Orderly%20Queue/README.md)
 
 - 0900-0999
-  - [0900.RLE Iterator](/solution/0900-0999/0900.RLE%20Iterator/README.md)
-  - [0901.Online Stock Span](/solution/0900-0999/0901.Online%20Stock%20Span/README.md)
-  - [0902.Numbers At Most N Given Digit Set](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
-  - [0903.Valid Permutations for DI Sequence](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README.md)
-  - [0904.Fruit Into Baskets](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README.md)
-  - [0905.Sort Array By Parity](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README.md)
-  - [0906.Super Palindromes](/solution/0900-0999/0906.Super%20Palindromes/README.md)
-  - [0907.Sum of Subarray Minimums](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md)
-  - [0908.Smallest Range I](/solution/0900-0999/0908.Smallest%20Range%20I/README.md)
-  - [0909.Snakes and Ladders](/solution/0900-0999/0909.Snakes%20and%20Ladders/README.md)
-  - [0910.Smallest Range II](/solution/0900-0999/0910.Smallest%20Range%20II/README.md)
-  - [0911.Online Election](/solution/0900-0999/0911.Online%20Election/README.md)
-  - [0912.Sort an Array](/solution/0900-0999/0912.Sort%20an%20Array/README.md)
-  - [0913.Cat and Mouse](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md)
-  - [0914.X of a Kind in a Deck of Cards](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md)
-  - [0915.Partition Array into Disjoint Intervals](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md)
-  - [0916.Word Subsets](/solution/0900-0999/0916.Word%20Subsets/README.md)
-  - [0917.Reverse Only Letters](/solution/0900-0999/0917.Reverse%20Only%20Letters/README.md)
-  - [0918.Maximum Sum Circular Subarray](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README.md)
-  - [0919.Complete Binary Tree Inserter](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README.md)
-  - [0920.Number of Music Playlists](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README.md)
-  - [0921.Minimum Add to Make Parentheses Valid](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README.md)
-  - [0922.Sort Array By Parity II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README.md)
-  - [0923.3Sum With Multiplicity](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README.md)
-  - [0924.Minimize Malware Spread](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md)
-  - [0925.Long Pressed Name](/solution/0900-0999/0925.Long%20Pressed%20Name/README.md)
-  - [0926.Flip String to Monotone Increasing](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README.md)
-  - [0927.Three Equal Parts](/solution/0900-0999/0927.Three%20Equal%20Parts/README.md)
-  - [0928.Minimize Malware Spread II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md)
-  - [0929.Unique Email Addresses](/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md)
-  - [0930.Binary Subarrays With Sum](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md)
-  - [0931.Minimum Falling Path Sum](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md)
-  - [0932.Beautiful Array](/solution/0900-0999/0932.Beautiful%20Array/README.md)
-  - [0933.Number of Recent Calls](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md)
-  - [0934.Shortest Bridge](/solution/0900-0999/0934.Shortest%20Bridge/README.md)
-  - [0935.Knight Dialer](/solution/0900-0999/0935.Knight%20Dialer/README.md)
-  - [0936.Stamping The Sequence](/solution/0900-0999/0936.Stamping%20The%20Sequence/README.md)
-  - [0937.Reorder Data in Log Files](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README.md)
-  - [0938.Range Sum of BST](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README.md)
-  - [0939.Minimum Area Rectangle](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README.md)
-  - [0940.Distinct Subsequences II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md)
-  - [0941.Valid Mountain Array](/solution/0900-0999/0941.Valid%20Mountain%20Array/README.md)
-  - [0942.DI String Match](/solution/0900-0999/0942.DI%20String%20Match/README.md)
-  - [0943.Find the Shortest Superstring](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README.md)
-  - [0944.Delete Columns to Make Sorted](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README.md)
-  - [0945.Minimum Increment to Make Array Unique](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README.md)
-  - [0946.Validate Stack Sequences](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README.md)
-  - [0947.Most Stones Removed with Same Row or Column](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README.md)
-  - [0948.Bag of Tokens](/solution/0900-0999/0948.Bag%20of%20Tokens/README.md)
-  - [0949.Largest Time for Given Digits](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README.md)
-  - [0950.Reveal Cards In Increasing Order](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README.md)
-  - [0951.Flip Equivalent Binary Trees](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README.md)
-  - [0952.Largest Component Size by Common Factor](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README.md)
-  - [0953.Verifying an Alien Dictionary](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README.md)
-  - [0954.Array of Doubled Pairs](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README.md)
-  - [0955.Delete Columns to Make Sorted II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README.md)
-  - [0956.Tallest Billboard](/solution/0900-0999/0956.Tallest%20Billboard/README.md)
-  - [0957.Prison Cells After N Days](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README.md)
-  - [0958.Check Completeness of a Binary Tree](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README.md)
-  - [0959.Regions Cut By Slashes](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md)
-  - [0960.Delete Columns to Make Sorted III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md)
-  - [0961.N-Repeated Element in Size 2N Array](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README.md)
-  - [0962.Maximum Width Ramp](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md)
-  - [0963.Minimum Area Rectangle II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README.md)
-  - [0964.Least Operators to Express Number](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README.md)
-  - [0965.Univalued Binary Tree](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README.md)
-  - [0966.Vowel Spellchecker](/solution/0900-0999/0966.Vowel%20Spellchecker/README.md)
-  - [0967.Numbers With Same Consecutive Differences](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README.md)
-  - [0968.Binary Tree Cameras](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README.md)
-  - [0969.Pancake Sorting](/solution/0900-0999/0969.Pancake%20Sorting/README.md)
-  - [0970.Powerful Integers](/solution/0900-0999/0970.Powerful%20Integers/README.md)
-  - [0971.Flip Binary Tree To Match Preorder Traversal](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README.md)
-  - [0972.Equal Rational Numbers](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README.md)
-  - [0973.K Closest Points to Origin](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README.md)
-  - [0974.Subarray Sums Divisible by K](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README.md)
-  - [0975.Odd Even Jump](/solution/0900-0999/0975.Odd%20Even%20Jump/README.md)
-  - [0976.Largest Perimeter Triangle](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README.md)
-  - [0977.Squares of a Sorted Array](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README.md)
-  - [0978.Longest Turbulent Subarray](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README.md)
-  - [0979.Distribute Coins in Binary Tree](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README.md)
-  - [0980.Unique Paths III](/solution/0900-0999/0980.Unique%20Paths%20III/README.md)
-  - [0981.Time Based Key-Value Store](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README.md)
-  - [0982.Triples with Bitwise AND Equal To Zero](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README.md)
-  - [0983.Minimum Cost For Tickets](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README.md)
-  - [0984.String Without AAA or BBB](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README.md)
-  - [0985.Sum of Even Numbers After Queries](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README.md)
-  - [0986.Interval List Intersections](/solution/0900-0999/0986.Interval%20List%20Intersections/README.md)
-  - [0987.Vertical Order Traversal of a Binary Tree](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md)
-  - [0988.Smallest String Starting From Leaf](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md)
-  - [0989.Add to Array-Form of Integer](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md)
-  - [0990.Satisfiability of Equality Equations](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md)
-  - [0991.Broken Calculator](/solution/0900-0999/0991.Broken%20Calculator/README.md)
-  - [0992.Subarrays with K Different Integers](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md)
-  - [0993.Cousins in Binary Tree](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README.md)
-  - [0994.Rotting Oranges](/solution/0900-0999/0994.Rotting%20Oranges/README.md)
-  - [0995.Minimum Number of K Consecutive Bit Flips](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README.md)
-  - [0996.Number of Squareful Arrays](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README.md)
-  - [0997.Find the Town Judge](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README.md)
-  - [0998.Maximum Binary Tree II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README.md)
-  - [0999.Available Captures for Rook](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README.md)
+  - [0900.RLE 迭代器](/solution/0900-0999/0900.RLE%20Iterator/README.md)
+  - [0901.股票价格跨度](/solution/0900-0999/0901.Online%20Stock%20Span/README.md)
+  - [0902.最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md)
+  - [0903.DI 序列的有效排列](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README.md)
+  - [0904.水果成篮](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README.md)
+  - [0905.按奇偶排序数组](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README.md)
+  - [0906.超级回文数](/solution/0900-0999/0906.Super%20Palindromes/README.md)
+  - [0907.子数组的最小值之和](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md)
+  - [0908.最小差值 I](/solution/0900-0999/0908.Smallest%20Range%20I/README.md)
+  - [0909.蛇梯棋](/solution/0900-0999/0909.Snakes%20and%20Ladders/README.md)
+  - [0910.最小差值 II](/solution/0900-0999/0910.Smallest%20Range%20II/README.md)
+  - [0911.在线选举](/solution/0900-0999/0911.Online%20Election/README.md)
+  - [0912.排序数组](/solution/0900-0999/0912.Sort%20an%20Array/README.md)
+  - [0913.猫和老鼠](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md)
+  - [0914.卡牌分组](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md)
+  - [0915.分割数组](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md)
+  - [0916.单词子集](/solution/0900-0999/0916.Word%20Subsets/README.md)
+  - [0917.仅仅反转字母](/solution/0900-0999/0917.Reverse%20Only%20Letters/README.md)
+  - [0918.环形子数组的最大和](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README.md)
+  - [0919.完全二叉树插入器](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README.md)
+  - [0920.播放列表的数量](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README.md)
+  - [0921.使括号有效的最少添加](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README.md)
+  - [0922.按奇偶排序数组 II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README.md)
+  - [0923.三数之和的多种可能](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README.md)
+  - [0924.尽量减少恶意软件的传播](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md)
+  - [0925.长按键入](/solution/0900-0999/0925.Long%20Pressed%20Name/README.md)
+  - [0926.将字符串翻转到单调递增](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README.md)
+  - [0927.三等分](/solution/0900-0999/0927.Three%20Equal%20Parts/README.md)
+  - [0928.尽量减少恶意软件的传播 II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md)
+  - [0929.独特的电子邮件地址](/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md)
+  - [0930.和相同的二元子数组](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md)
+  - [0931.下降路径最小和](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md)
+  - [0932.漂亮数组](/solution/0900-0999/0932.Beautiful%20Array/README.md)
+  - [0933.最近的请求次数](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md)
+  - [0934.最短的桥](/solution/0900-0999/0934.Shortest%20Bridge/README.md)
+  - [0935.骑士拨号器](/solution/0900-0999/0935.Knight%20Dialer/README.md)
+  - [0936.戳印序列](/solution/0900-0999/0936.Stamping%20The%20Sequence/README.md)
+  - [0937.重新排列日志文件](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README.md)
+  - [0938.二叉搜索树的范围和](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README.md)
+  - [0939.最小面积矩形](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README.md)
+  - [0940.不同的子序列 II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md)
+  - [0941.有效的山脉数组](/solution/0900-0999/0941.Valid%20Mountain%20Array/README.md)
+  - [0942.增减字符串匹配](/solution/0900-0999/0942.DI%20String%20Match/README.md)
+  - [0943.最短超级串](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README.md)
+  - [0944.删列造序](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README.md)
+  - [0945.使数组唯一的最小增量](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README.md)
+  - [0946.验证栈序列](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README.md)
+  - [0947.移除最多的同行或同列石头](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README.md)
+  - [0948.令牌放置](/solution/0900-0999/0948.Bag%20of%20Tokens/README.md)
+  - [0949.给定数字能组成的最大时间](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README.md)
+  - [0950.按递增顺序显示卡牌](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README.md)
+  - [0951.翻转等价二叉树](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README.md)
+  - [0952.按公因数计算最大组件大小](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README.md)
+  - [0953.验证外星语词典](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README.md)
+  - [0954.二倍数对数组](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README.md)
+  - [0955.删列造序 II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README.md)
+  - [0956.最高的广告牌](/solution/0900-0999/0956.Tallest%20Billboard/README.md)
+  - [0957.N 天后的牢房](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README.md)
+  - [0958.二叉树的完全性检验](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README.md)
+  - [0959.由斜杠划分区域](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md)
+  - [0960.删列造序 III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md)
+  - [0961.在长度 2N 的数组中找出重复 N 次的元素](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README.md)
+  - [0962.最大宽度坡](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md)
+  - [0963.最小面积矩形 II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README.md)
+  - [0964.表示数字的最少运算符](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README.md)
+  - [0965.单值二叉树](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README.md)
+  - [0966.元音拼写检查器](/solution/0900-0999/0966.Vowel%20Spellchecker/README.md)
+  - [0967.连续差相同的数字](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README.md)
+  - [0968.监控二叉树](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README.md)
+  - [0969.煎饼排序](/solution/0900-0999/0969.Pancake%20Sorting/README.md)
+  - [0970.强整数](/solution/0900-0999/0970.Powerful%20Integers/README.md)
+  - [0971.翻转二叉树以匹配先序遍历](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README.md)
+  - [0972.相等的有理数](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README.md)
+  - [0973.最接近原点的 K 个点](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README.md)
+  - [0974.和可被 K 整除的子数组](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README.md)
+  - [0975.奇偶跳](/solution/0900-0999/0975.Odd%20Even%20Jump/README.md)
+  - [0976.三角形的最大周长](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README.md)
+  - [0977.有序数组的平方](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README.md)
+  - [0978.最长湍流子数组](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README.md)
+  - [0979.在二叉树中分配硬币](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README.md)
+  - [0980.不同路径 III](/solution/0900-0999/0980.Unique%20Paths%20III/README.md)
+  - [0981.基于时间的键值存储](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README.md)
+  - [0982.按位与为零的三元组](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README.md)
+  - [0983.最低票价](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README.md)
+  - [0984.不含 AAA 或 BBB 的字符串](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README.md)
+  - [0985.查询后的偶数和](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README.md)
+  - [0986.区间列表的交集](/solution/0900-0999/0986.Interval%20List%20Intersections/README.md)
+  - [0987.二叉树的垂序遍历](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md)
+  - [0988.从叶结点开始的最小字符串](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md)
+  - [0989.数组形式的整数加法](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md)
+  - [0990.等式方程的可满足性](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md)
+  - [0991.坏了的计算器](/solution/0900-0999/0991.Broken%20Calculator/README.md)
+  - [0992.K 个不同整数的子数组](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md)
+  - [0993.二叉树的堂兄弟节点](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README.md)
+  - [0994.腐烂的橘子](/solution/0900-0999/0994.Rotting%20Oranges/README.md)
+  - [0995.K 连续位的最小翻转次数](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README.md)
+  - [0996.正方形数组的数目](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README.md)
+  - [0997.找到小镇的法官](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README.md)
+  - [0998.最大二叉树 II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README.md)
+  - [0999.可以被一步捕获的棋子数](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README.md)
 
 - 1000-1099
-  - [1000.Minimum Cost to Merge Stones](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README.md)
-  - [1001.Grid Illumination](/solution/1000-1099/1001.Grid%20Illumination/README.md)
-  - [1002.Find Common Characters](/solution/1000-1099/1002.Find%20Common%20Characters/README.md)
-  - [1003.Check If Word Is Valid After Substitutions](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README.md)
-  - [1004.Max Consecutive Ones III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md)
-  - [1005.Maximize Sum Of Array After K Negations](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README.md)
-  - [1006.Clumsy Factorial](/solution/1000-1099/1006.Clumsy%20Factorial/README.md)
-  - [1007.Minimum Domino Rotations For Equal Row](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README.md)
-  - [1008.Construct Binary Search Tree from Preorder Traversal](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README.md)
-  - [1009.Complement of Base 10 Integer](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README.md)
-  - [1010.Pairs of Songs With Total Durations Divisible by 60](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README.md)
-  - [1011.Capacity To Ship Packages Within D Days](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README.md)
-  - [1012.Numbers With Repeated Digits](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
-  - [1013.Partition Array Into Three Parts With Equal Sum](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README.md)
-  - [1014.Best Sightseeing Pair](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README.md)
-  - [1015.Smallest Integer Divisible by K](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README.md)
-  - [1016.Binary String With Substrings Representing 1 To N](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README.md)
-  - [1017.Convert to Base -2](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README.md)
-  - [1018.Binary Prefix Divisible By 5](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README.md)
-  - [1019.Next Greater Node In Linked List](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README.md)
-  - [1020.Number of Enclaves](/solution/1000-1099/1020.Number%20of%20Enclaves/README.md)
-  - [1021.Remove Outermost Parentheses](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md)
-  - [1022.Sum of Root To Leaf Binary Numbers](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README.md)
-  - [1023.Camelcase Matching](/solution/1000-1099/1023.Camelcase%20Matching/README.md)
-  - [1024.Video Stitching](/solution/1000-1099/1024.Video%20Stitching/README.md)
-  - [1025.Divisor Game](/solution/1000-1099/1025.Divisor%20Game/README.md)
-  - [1026.Maximum Difference Between Node and Ancestor](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README.md)
-  - [1027.Longest Arithmetic Subsequence](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README.md)
-  - [1028.Recover a Tree From Preorder Traversal](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README.md)
-  - [1029.Two City Scheduling](/solution/1000-1099/1029.Two%20City%20Scheduling/README.md)
-  - [1030.Matrix Cells in Distance Order](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README.md)
-  - [1031.Maximum Sum of Two Non-Overlapping Subarrays](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README.md)
-  - [1032.Stream of Characters](/solution/1000-1099/1032.Stream%20of%20Characters/README.md)
-  - [1033.Moving Stones Until Consecutive](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README.md)
-  - [1034.Coloring A Border](/solution/1000-1099/1034.Coloring%20A%20Border/README.md)
-  - [1035.Uncrossed Lines](/solution/1000-1099/1035.Uncrossed%20Lines/README.md)
-  - [1036.Escape a Large Maze](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README.md)
-  - [1037.Valid Boomerang](/solution/1000-1099/1037.Valid%20Boomerang/README.md)
-  - [1038.Binary Search Tree to Greater Sum Tree](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README.md)
-  - [1039.Minimum Score Triangulation of Polygon](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md)
-  - [1040.Moving Stones Until Consecutive II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README.md)
-  - [1041.Robot Bounded In Circle](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README.md)
-  - [1042.Flower Planting With No Adjacent](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README.md)
-  - [1043.Partition Array for Maximum Sum](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README.md)
-  - [1044.Longest Duplicate Substring](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md)
-  - [1045.Customers Who Bought All Products](/solution/1000-1099/1045.Customers%20Who%20Bought%20All%20Products/README.md)
-  - [1046.Last Stone Weight](/solution/1000-1099/1046.Last%20Stone%20Weight/README.md)
-  - [1047.Remove All Adjacent Duplicates In String](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README.md)
-  - [1048.Longest String Chain](/solution/1000-1099/1048.Longest%20String%20Chain/README.md)
-  - [1049.Last Stone Weight II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md)
-  - [1050.Actors and Directors Who Cooperated At Least Three Times](/solution/1000-1099/1050.Actors%20and%20Directors%20Who%20Cooperated%20At%20Least%20Three%20Times/README.md)
-  - [1051.Height Checker](/solution/1000-1099/1051.Height%20Checker/README.md)
-  - [1052.Grumpy Bookstore Owner](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README.md)
-  - [1053.Previous Permutation With One Swap](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README.md)
-  - [1054.Distant Barcodes](/solution/1000-1099/1054.Distant%20Barcodes/README.md)
-  - [1055.Shortest Way to Form String](/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README.md)
-  - [1056.Confusing Number](/solution/1000-1099/1056.Confusing%20Number/README.md)
-  - [1057.Campus Bikes](/solution/1000-1099/1057.Campus%20Bikes/README.md)
-  - [1058.Minimize Rounding Error to Meet Target](/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README.md)
-  - [1059.All Paths from Source Lead to Destination](/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README.md)
-  - [1060.Missing Element in Sorted Array](/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README.md)
-  - [1061.Lexicographically Smallest Equivalent String](/solution/1000-1099/1061.Lexicographically%20Smallest%20Equivalent%20String/README.md)
-  - [1062.Longest Repeating Substring](/solution/1000-1099/1062.Longest%20Repeating%20Substring/README.md)
-  - [1063.Number of Valid Subarrays](/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README.md)
-  - [1064.Fixed Point](/solution/1000-1099/1064.Fixed%20Point/README.md)
-  - [1065.Index Pairs of a String](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md)
-  - [1066.Campus Bikes II](/solution/1000-1099/1066.Campus%20Bikes%20II/README.md)
-  - [1067.Digit Count in Range](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README.md)
-  - [1068.Product Sales Analysis I](/solution/1000-1099/1068.Product%20Sales%20Analysis%20I/README.md)
-  - [1069.Product Sales Analysis II](/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README.md)
-  - [1070.Product Sales Analysis III](/solution/1000-1099/1070.Product%20Sales%20Analysis%20III/README.md)
-  - [1071.Greatest Common Divisor of Strings](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README.md)
-  - [1072.Flip Columns For Maximum Number of Equal Rows](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md)
-  - [1073.Adding Two Negabinary Numbers](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md)
-  - [1074.Number of Submatrices That Sum to Target](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README.md)
-  - [1075.Project Employees I](/solution/1000-1099/1075.Project%20Employees%20I/README.md)
-  - [1076.Project Employees II](/solution/1000-1099/1076.Project%20Employees%20II/README.md)
-  - [1077.Project Employees III](/solution/1000-1099/1077.Project%20Employees%20III/README.md)
-  - [1078.Occurrences After Bigram](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README.md)
-  - [1079.Letter Tile Possibilities](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README.md)
-  - [1080.Insufficient Nodes in Root to Leaf Paths](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README.md)
-  - [1081.Smallest Subsequence of Distinct Characters](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README.md)
-  - [1082.Sales Analysis I](/solution/1000-1099/1082.Sales%20Analysis%20I/README.md)
-  - [1083.Sales Analysis II](/solution/1000-1099/1083.Sales%20Analysis%20II/README.md)
-  - [1084.Sales Analysis III](/solution/1000-1099/1084.Sales%20Analysis%20III/README.md)
-  - [1085.Sum of Digits in the Minimum Number](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README.md)
-  - [1086.High Five](/solution/1000-1099/1086.High%20Five/README.md)
-  - [1087.Brace Expansion](/solution/1000-1099/1087.Brace%20Expansion/README.md)
-  - [1088.Confusing Number II](/solution/1000-1099/1088.Confusing%20Number%20II/README.md)
-  - [1089.Duplicate Zeros](/solution/1000-1099/1089.Duplicate%20Zeros/README.md)
-  - [1090.Largest Values From Labels](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README.md)
-  - [1091.Shortest Path in Binary Matrix](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README.md)
-  - [1092.Shortest Common Supersequence](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README.md)
-  - [1093.Statistics from a Large Sample](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README.md)
-  - [1094.Car Pooling](/solution/1000-1099/1094.Car%20Pooling/README.md)
-  - [1095.Find in Mountain Array](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README.md)
-  - [1096.Brace Expansion II](/solution/1000-1099/1096.Brace%20Expansion%20II/README.md)
-  - [1097.Game Play Analysis V](/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README.md)
-  - [1098.Unpopular Books](/solution/1000-1099/1098.Unpopular%20Books/README.md)
-  - [1099.Two Sum Less Than K](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README.md)
+  - [1000.合并石头的最低成本](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README.md)
+  - [1001.网格照明](/solution/1000-1099/1001.Grid%20Illumination/README.md)
+  - [1002.查找共用字符](/solution/1000-1099/1002.Find%20Common%20Characters/README.md)
+  - [1003.检查替换后的词是否有效](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README.md)
+  - [1004.最大连续1的个数 III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md)
+  - [1005.K 次取反后最大化的数组和](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README.md)
+  - [1006.笨阶乘](/solution/1000-1099/1006.Clumsy%20Factorial/README.md)
+  - [1007.行相等的最少多米诺旋转](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README.md)
+  - [1008.前序遍历构造二叉搜索树](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README.md)
+  - [1009.十进制整数的反码](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README.md)
+  - [1010.总持续时间可被 60 整除的歌曲](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README.md)
+  - [1011.在 D 天内送达包裹的能力](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README.md)
+  - [1012.至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md)
+  - [1013.将数组分成和相等的三个部分](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README.md)
+  - [1014.最佳观光组合](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README.md)
+  - [1015.可被 K 整除的最小整数](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README.md)
+  - [1016.子串能表示从 1 到 N 数字的二进制串](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README.md)
+  - [1017.负二进制转换](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README.md)
+  - [1018.可被 5 整除的二进制前缀](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README.md)
+  - [1019.链表中的下一个更大节点](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README.md)
+  - [1020.飞地的数量](/solution/1000-1099/1020.Number%20of%20Enclaves/README.md)
+  - [1021.删除最外层的括号](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md)
+  - [1022.从根到叶的二进制数之和](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README.md)
+  - [1023.驼峰式匹配](/solution/1000-1099/1023.Camelcase%20Matching/README.md)
+  - [1024.视频拼接](/solution/1000-1099/1024.Video%20Stitching/README.md)
+  - [1025.除数博弈](/solution/1000-1099/1025.Divisor%20Game/README.md)
+  - [1026.节点与其祖先之间的最大差值](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README.md)
+  - [1027.最长等差数列](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README.md)
+  - [1028.从先序遍历还原二叉树](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README.md)
+  - [1029.两地调度](/solution/1000-1099/1029.Two%20City%20Scheduling/README.md)
+  - [1030.距离顺序排列矩阵单元格](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README.md)
+  - [1031.两个非重叠子数组的最大和](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README.md)
+  - [1032.字符流](/solution/1000-1099/1032.Stream%20of%20Characters/README.md)
+  - [1033.移动石子直到连续](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README.md)
+  - [1034.边界着色](/solution/1000-1099/1034.Coloring%20A%20Border/README.md)
+  - [1035.不相交的线](/solution/1000-1099/1035.Uncrossed%20Lines/README.md)
+  - [1036.逃离大迷宫](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README.md)
+  - [1037.有效的回旋镖](/solution/1000-1099/1037.Valid%20Boomerang/README.md)
+  - [1038.从二叉搜索树到更大和树](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README.md)
+  - [1039.多边形三角剖分的最低得分](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md)
+  - [1040.移动石子直到连续 II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README.md)
+  - [1041.困于环中的机器人](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README.md)
+  - [1042.不邻接植花](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README.md)
+  - [1043.分隔数组以得到最大和](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README.md)
+  - [1044.最长重复子串](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md)
+  - [1045.买下所有产品的客户](/solution/1000-1099/1045.Customers%20Who%20Bought%20All%20Products/README.md)
+  - [1046.最后一块石头的重量](/solution/1000-1099/1046.Last%20Stone%20Weight/README.md)
+  - [1047.删除字符串中的所有相邻重复项](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README.md)
+  - [1048.最长字符串链](/solution/1000-1099/1048.Longest%20String%20Chain/README.md)
+  - [1049.最后一块石头的重量 II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md)
+  - [1050.合作过至少三次的演员和导演](/solution/1000-1099/1050.Actors%20and%20Directors%20Who%20Cooperated%20At%20Least%20Three%20Times/README.md)
+  - [1051.高度检查器](/solution/1000-1099/1051.Height%20Checker/README.md)
+  - [1052.爱生气的书店老板](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README.md)
+  - [1053.交换一次的先前排列](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README.md)
+  - [1054.距离相等的条形码](/solution/1000-1099/1054.Distant%20Barcodes/README.md)
+  - [1055.形成字符串的最短路径](/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README.md)
+  - [1056.易混淆数](/solution/1000-1099/1056.Confusing%20Number/README.md)
+  - [1057.校园自行车分配](/solution/1000-1099/1057.Campus%20Bikes/README.md)
+  - [1058.最小化舍入误差以满足目标](/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README.md)
+  - [1059.从始点到终点的所有路径](/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README.md)
+  - [1060.有序数组中的缺失元素](/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README.md)
+  - [1061.按字典序排列最小的等效字符串](/solution/1000-1099/1061.Lexicographically%20Smallest%20Equivalent%20String/README.md)
+  - [1062.最长重复子串](/solution/1000-1099/1062.Longest%20Repeating%20Substring/README.md)
+  - [1063.有效子数组的数目](/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README.md)
+  - [1064.不动点](/solution/1000-1099/1064.Fixed%20Point/README.md)
+  - [1065.字符串的索引对](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md)
+  - [1066.校园自行车分配 II](/solution/1000-1099/1066.Campus%20Bikes%20II/README.md)
+  - [1067.范围内的数字计数](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README.md)
+  - [1068.产品销售分析 I](/solution/1000-1099/1068.Product%20Sales%20Analysis%20I/README.md)
+  - [1069.产品销售分析 II](/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README.md)
+  - [1070.产品销售分析 III](/solution/1000-1099/1070.Product%20Sales%20Analysis%20III/README.md)
+  - [1071.字符串的最大公因子](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README.md)
+  - [1072.按列翻转得到最大值等行数](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md)
+  - [1073.负二进制数相加](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md)
+  - [1074.元素和为目标值的子矩阵数量](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README.md)
+  - [1075.项目员工 I](/solution/1000-1099/1075.Project%20Employees%20I/README.md)
+  - [1076.项目员工II](/solution/1000-1099/1076.Project%20Employees%20II/README.md)
+  - [1077.项目员工 III](/solution/1000-1099/1077.Project%20Employees%20III/README.md)
+  - [1078.Bigram 分词](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README.md)
+  - [1079.活字印刷](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README.md)
+  - [1080.根到叶路径上的不足节点](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README.md)
+  - [1081.不同字符的最小子序列](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README.md)
+  - [1082.销售分析 I ](/solution/1000-1099/1082.Sales%20Analysis%20I/README.md)
+  - [1083.销售分析 II](/solution/1000-1099/1083.Sales%20Analysis%20II/README.md)
+  - [1084.销售分析III](/solution/1000-1099/1084.Sales%20Analysis%20III/README.md)
+  - [1085.最小元素各数位之和](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README.md)
+  - [1086.前五科的均分](/solution/1000-1099/1086.High%20Five/README.md)
+  - [1087.花括号展开](/solution/1000-1099/1087.Brace%20Expansion/README.md)
+  - [1088.易混淆数 II](/solution/1000-1099/1088.Confusing%20Number%20II/README.md)
+  - [1089.复写零](/solution/1000-1099/1089.Duplicate%20Zeros/README.md)
+  - [1090.受标签影响的最大值](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README.md)
+  - [1091.二进制矩阵中的最短路径](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README.md)
+  - [1092.最短公共超序列](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README.md)
+  - [1093.大样本统计](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README.md)
+  - [1094.拼车](/solution/1000-1099/1094.Car%20Pooling/README.md)
+  - [1095.山脉数组中查找目标值](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README.md)
+  - [1096.花括号展开 II](/solution/1000-1099/1096.Brace%20Expansion%20II/README.md)
+  - [1097.游戏玩法分析 V](/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README.md)
+  - [1098.小众书籍](/solution/1000-1099/1098.Unpopular%20Books/README.md)
+  - [1099.小于 K 的两数之和](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README.md)
 
 - 1100-1199
-  - [1100.Find K-Length Substrings With No Repeated Characters](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README.md)
-  - [1101.The Earliest Moment When Everyone Become Friends](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README.md)
-  - [1102.Path With Maximum Minimum Value](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README.md)
-  - [1103.Distribute Candies to People](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README.md)
-  - [1104.Path In Zigzag Labelled Binary Tree](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README.md)
-  - [1105.Filling Bookcase Shelves](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README.md)
-  - [1106.Parsing A Boolean Expression](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README.md)
-  - [1107.New Users Daily Count](/solution/1100-1199/1107.New%20Users%20Daily%20Count/README.md)
-  - [1108.Defanging an IP Address](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README.md)
-  - [1109.Corporate Flight Bookings](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README.md)
-  - [1110.Delete Nodes And Return Forest](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README.md)
-  - [1111.Maximum Nesting Depth of Two Valid Parentheses Strings](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README.md)
-  - [1112.Highest Grade For Each Student](/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README.md)
-  - [1113.Reported Posts](/solution/1100-1199/1113.Reported%20Posts/README.md)
-  - [1114.Print in Order](/solution/1100-1199/1114.Print%20in%20Order/README.md)
-  - [1115.Print FooBar Alternately](/solution/1100-1199/1115.Print%20FooBar%20Alternately/README.md)
-  - [1116.Print Zero Even Odd](/solution/1100-1199/1116.Print%20Zero%20Even%20Odd/README.md)
-  - [1117.Building H2O](/solution/1100-1199/1117.Building%20H2O/README.md)
-  - [1118.Number of Days in a Month](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README.md)
-  - [1119.Remove Vowels from a String](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README.md)
-  - [1120.Maximum Average Subtree](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README.md)
-  - [1121.Divide Array Into Increasing Sequences](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README.md)
-  - [1122.Relative Sort Array](/solution/1100-1199/1122.Relative%20Sort%20Array/README.md)
-  - [1123.Lowest Common Ancestor of Deepest Leaves](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README.md)
-  - [1124.Longest Well-Performing Interval](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README.md)
-  - [1125.Smallest Sufficient Team](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README.md)
-  - [1126.Active Businesses](/solution/1100-1199/1126.Active%20Businesses/README.md)
-  - [1127.User Purchase Platform](/solution/1100-1199/1127.User%20Purchase%20Platform/README.md)
-  - [1128.Number of Equivalent Domino Pairs](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README.md)
-  - [1129.Shortest Path with Alternating Colors](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README.md)
-  - [1130.Minimum Cost Tree From Leaf Values](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README.md)
-  - [1131.Maximum of Absolute Value Expression](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md)
-  - [1132.Reported Posts II](/solution/1100-1199/1132.Reported%20Posts%20II/README.md)
-  - [1133.Largest Unique Number](/solution/1100-1199/1133.Largest%20Unique%20Number/README.md)
-  - [1134.Armstrong Number](/solution/1100-1199/1134.Armstrong%20Number/README.md)
-  - [1135.Connecting Cities With Minimum Cost](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md)
-  - [1136.Parallel Courses](/solution/1100-1199/1136.Parallel%20Courses/README.md)
-  - [1137.N-th Tribonacci Number](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README.md)
-  - [1138.Alphabet Board Path](/solution/1100-1199/1138.Alphabet%20Board%20Path/README.md)
-  - [1139.Largest 1-Bordered Square](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md)
-  - [1140.Stone Game II](/solution/1100-1199/1140.Stone%20Game%20II/README.md)
-  - [1141.User Activity for the Past 30 Days I](/solution/1100-1199/1141.User%20Activity%20for%20the%20Past%2030%20Days%20I/README.md)
-  - [1142.User Activity for the Past 30 Days II](/solution/1100-1199/1142.User%20Activity%20for%20the%20Past%2030%20Days%20II/README.md)
-  - [1143.Longest Common Subsequence](/solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md)
-  - [1144.Decrease Elements To Make Array Zigzag](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README.md)
-  - [1145.Binary Tree Coloring Game](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README.md)
-  - [1146.Snapshot Array](/solution/1100-1199/1146.Snapshot%20Array/README.md)
-  - [1147.Longest Chunked Palindrome Decomposition](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README.md)
-  - [1148.Article Views I](/solution/1100-1199/1148.Article%20Views%20I/README.md)
-  - [1149.Article Views II](/solution/1100-1199/1149.Article%20Views%20II/README.md)
-  - [1150.Check If a Number Is Majority Element in a Sorted Array](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README.md)
-  - [1151.Minimum Swaps to Group All 1's Together](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README.md)
-  - [1152.Analyze User Website Visit Pattern](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README.md)
-  - [1153.String Transforms Into Another String](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README.md)
-  - [1154.Day of the Year](/solution/1100-1199/1154.Day%20of%20the%20Year/README.md)
-  - [1155.Number of Dice Rolls With Target Sum](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README.md)
-  - [1156.Swap For Longest Repeated Character Substring](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README.md)
-  - [1157.Online Majority Element In Subarray](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README.md)
-  - [1158.Market Analysis I](/solution/1100-1199/1158.Market%20Analysis%20I/README.md)
-  - [1159.Market Analysis II](/solution/1100-1199/1159.Market%20Analysis%20II/README.md)
-  - [1160.Find Words That Can Be Formed by Characters](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README.md)
-  - [1161.Maximum Level Sum of a Binary Tree](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README.md)
-  - [1162.As Far from Land as Possible](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README.md)
-  - [1163.Last Substring in Lexicographical Order](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README.md)
-  - [1164.Product Price at a Given Date](/solution/1100-1199/1164.Product%20Price%20at%20a%20Given%20Date/README.md)
-  - [1165.Single-Row Keyboard](/solution/1100-1199/1165.Single-Row%20Keyboard/README.md)
-  - [1166.Design File System](/solution/1100-1199/1166.Design%20File%20System/README.md)
-  - [1167.Minimum Cost to Connect Sticks](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README.md)
-  - [1168.Optimize Water Distribution in a Village](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md)
-  - [1169.Invalid Transactions](/solution/1100-1199/1169.Invalid%20Transactions/README.md)
-  - [1170.Compare Strings by Frequency of the Smallest Character](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README.md)
-  - [1171.Remove Zero Sum Consecutive Nodes from Linked List](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README.md)
-  - [1172.Dinner Plate Stacks](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README.md)
-  - [1173.Immediate Food Delivery I](/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README.md)
-  - [1174.Immediate Food Delivery II](/solution/1100-1199/1174.Immediate%20Food%20Delivery%20II/README.md)
-  - [1175.Prime Arrangements](/solution/1100-1199/1175.Prime%20Arrangements/README.md)
-  - [1176.Diet Plan Performance](/solution/1100-1199/1176.Diet%20Plan%20Performance/README.md)
-  - [1177.Can Make Palindrome from Substring](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README.md)
-  - [1178.Number of Valid Words for Each Puzzle](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README.md)
-  - [1179.Reformat Department Table](/solution/1100-1199/1179.Reformat%20Department%20Table/README.md)
-  - [1180.Count Substrings with Only One Distinct Letter](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README.md)
-  - [1181.Before and After Puzzle](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README.md)
-  - [1182.Shortest Distance to Target Color](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README.md)
-  - [1183.Maximum Number of Ones](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README.md)
-  - [1184.Distance Between Bus Stops](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README.md)
-  - [1185.Day of the Week](/solution/1100-1199/1185.Day%20of%20the%20Week/README.md)
-  - [1186.Maximum Subarray Sum with One Deletion](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README.md)
-  - [1187.Make Array Strictly Increasing](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README.md)
-  - [1188.Design Bounded Blocking Queue](/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README.md)
-  - [1189.Maximum Number of Balloons](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README.md)
-  - [1190.Reverse Substrings Between Each Pair of Parentheses](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README.md)
-  - [1191.K-Concatenation Maximum Sum](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README.md)
-  - [1192.Critical Connections in a Network](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README.md)
-  - [1193.Monthly Transactions I](/solution/1100-1199/1193.Monthly%20Transactions%20I/README.md)
-  - [1194.Tournament Winners](/solution/1100-1199/1194.Tournament%20Winners/README.md)
-  - [1195.Fizz Buzz Multithreaded](/solution/1100-1199/1195.Fizz%20Buzz%20Multithreaded/README.md)
-  - [1196.How Many Apples Can You Put into the Basket](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README.md)
-  - [1197.Minimum Knight Moves](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md)
-  - [1198.Find Smallest Common Element in All Rows](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README.md)
-  - [1199.Minimum Time to Build Blocks](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README.md)
+  - [1100.长度为 K 的无重复字符子串](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README.md)
+  - [1101.彼此熟识的最早时间](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README.md)
+  - [1102.得分最高的路径](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README.md)
+  - [1103.分糖果 II](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README.md)
+  - [1104.二叉树寻路](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README.md)
+  - [1105.填充书架](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README.md)
+  - [1106.解析布尔表达式](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README.md)
+  - [1107.每日新用户统计](/solution/1100-1199/1107.New%20Users%20Daily%20Count/README.md)
+  - [1108.IP 地址无效化](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README.md)
+  - [1109.航班预订统计](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README.md)
+  - [1110.删点成林](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README.md)
+  - [1111.有效括号的嵌套深度](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README.md)
+  - [1112.每位学生的最高成绩](/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README.md)
+  - [1113.报告的记录](/solution/1100-1199/1113.Reported%20Posts/README.md)
+  - [1114.按序打印](/solution/1100-1199/1114.Print%20in%20Order/README.md)
+  - [1115.交替打印 FooBar](/solution/1100-1199/1115.Print%20FooBar%20Alternately/README.md)
+  - [1116.打印零与奇偶数](/solution/1100-1199/1116.Print%20Zero%20Even%20Odd/README.md)
+  - [1117.H2O 生成](/solution/1100-1199/1117.Building%20H2O/README.md)
+  - [1118.一月有多少天](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README.md)
+  - [1119.删去字符串中的元音](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README.md)
+  - [1120.子树的最大平均值](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README.md)
+  - [1121.将数组分成几个递增序列](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README.md)
+  - [1122.数组的相对排序](/solution/1100-1199/1122.Relative%20Sort%20Array/README.md)
+  - [1123.最深叶节点的最近公共祖先](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README.md)
+  - [1124.表现良好的最长时间段](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README.md)
+  - [1125.最小的必要团队](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README.md)
+  - [1126.查询活跃业务](/solution/1100-1199/1126.Active%20Businesses/README.md)
+  - [1127.用户购买平台](/solution/1100-1199/1127.User%20Purchase%20Platform/README.md)
+  - [1128.等价多米诺骨牌对的数量](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README.md)
+  - [1129.颜色交替的最短路径](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README.md)
+  - [1130.叶值的最小代价生成树](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README.md)
+  - [1131.绝对值表达式的最大值](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md)
+  - [1132.报告的记录 II](/solution/1100-1199/1132.Reported%20Posts%20II/README.md)
+  - [1133.最大唯一数](/solution/1100-1199/1133.Largest%20Unique%20Number/README.md)
+  - [1134.阿姆斯特朗数](/solution/1100-1199/1134.Armstrong%20Number/README.md)
+  - [1135.最低成本联通所有城市](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md)
+  - [1136.平行课程](/solution/1100-1199/1136.Parallel%20Courses/README.md)
+  - [1137.第 N 个泰波那契数](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README.md)
+  - [1138.字母板上的路径](/solution/1100-1199/1138.Alphabet%20Board%20Path/README.md)
+  - [1139.最大的以 1 为边界的正方形](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md)
+  - [1140.石子游戏 II](/solution/1100-1199/1140.Stone%20Game%20II/README.md)
+  - [1141.查询近30天活跃用户数](/solution/1100-1199/1141.User%20Activity%20for%20the%20Past%2030%20Days%20I/README.md)
+  - [1142.过去30天的用户活动 II](/solution/1100-1199/1142.User%20Activity%20for%20the%20Past%2030%20Days%20II/README.md)
+  - [1143.最长公共子序列](/solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md)
+  - [1144.递减元素使数组呈锯齿状](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README.md)
+  - [1145.二叉树着色游戏](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README.md)
+  - [1146.快照数组](/solution/1100-1199/1146.Snapshot%20Array/README.md)
+  - [1147.段式回文](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README.md)
+  - [1148.文章浏览 I](/solution/1100-1199/1148.Article%20Views%20I/README.md)
+  - [1149.文章浏览 II](/solution/1100-1199/1149.Article%20Views%20II/README.md)
+  - [1150.检查一个数是否在数组中占绝大多数](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README.md)
+  - [1151.最少交换次数来组合所有的 1](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README.md)
+  - [1152.用户网站访问行为分析](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README.md)
+  - [1153.字符串转化](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README.md)
+  - [1154.一年中的第几天](/solution/1100-1199/1154.Day%20of%20the%20Year/README.md)
+  - [1155.掷骰子的N种方法](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README.md)
+  - [1156.单字符重复子串的最大长度](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README.md)
+  - [1157.子数组中占绝大多数的元素](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README.md)
+  - [1158.市场分析 I](/solution/1100-1199/1158.Market%20Analysis%20I/README.md)
+  - [1159.市场分析 II](/solution/1100-1199/1159.Market%20Analysis%20II/README.md)
+  - [1160.拼写单词](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README.md)
+  - [1161.最大层内元素和](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README.md)
+  - [1162.地图分析](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README.md)
+  - [1163.按字典序排在最后的子串](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README.md)
+  - [1164.指定日期的产品价格](/solution/1100-1199/1164.Product%20Price%20at%20a%20Given%20Date/README.md)
+  - [1165.单行键盘](/solution/1100-1199/1165.Single-Row%20Keyboard/README.md)
+  - [1166.设计文件系统](/solution/1100-1199/1166.Design%20File%20System/README.md)
+  - [1167.连接棒材的最低费用](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README.md)
+  - [1168.水资源分配优化](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md)
+  - [1169.查询无效交易](/solution/1100-1199/1169.Invalid%20Transactions/README.md)
+  - [1170.比较字符串最小字母出现频次](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README.md)
+  - [1171.从链表中删去总和值为零的连续节点](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README.md)
+  - [1172.餐盘栈](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README.md)
+  - [1173.即时食物配送 I](/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README.md)
+  - [1174.即时食物配送 II](/solution/1100-1199/1174.Immediate%20Food%20Delivery%20II/README.md)
+  - [1175.质数排列](/solution/1100-1199/1175.Prime%20Arrangements/README.md)
+  - [1176.健身计划评估](/solution/1100-1199/1176.Diet%20Plan%20Performance/README.md)
+  - [1177.构建回文串检测](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README.md)
+  - [1178.猜字谜](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README.md)
+  - [1179.重新格式化部门表](/solution/1100-1199/1179.Reformat%20Department%20Table/README.md)
+  - [1180.统计只含单一字母的子串](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README.md)
+  - [1181.前后拼接](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README.md)
+  - [1182.与目标颜色间的最短距离](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README.md)
+  - [1183.矩阵中 1 的最大数量](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README.md)
+  - [1184.公交站间的距离](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README.md)
+  - [1185.一周中的第几天](/solution/1100-1199/1185.Day%20of%20the%20Week/README.md)
+  - [1186.删除一次得到子数组最大和](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README.md)
+  - [1187.使数组严格递增](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README.md)
+  - [1188.设计有限阻塞队列](/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README.md)
+  - [1189.“气球” 的最大数量](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README.md)
+  - [1190.反转每对括号间的子串](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README.md)
+  - [1191.K 次串联后最大子数组之和](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README.md)
+  - [1192.查找集群内的「关键连接」](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README.md)
+  - [1193.每月交易 I](/solution/1100-1199/1193.Monthly%20Transactions%20I/README.md)
+  - [1194.锦标赛优胜者](/solution/1100-1199/1194.Tournament%20Winners/README.md)
+  - [1195.交替打印字符串](/solution/1100-1199/1195.Fizz%20Buzz%20Multithreaded/README.md)
+  - [1196.最多可以买到的苹果数量](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README.md)
+  - [1197.进击的骑士](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md)
+  - [1198.找出所有行中最小公共元素](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README.md)
+  - [1199.建造街区的最短时间](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README.md)
 
 - 1200-1299
-  - [1200.Minimum Absolute Difference](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README.md)
-  - [1201.Ugly Number III](/solution/1200-1299/1201.Ugly%20Number%20III/README.md)
-  - [1202.Smallest String With Swaps](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md)
-  - [1203.Sort Items by Groups Respecting Dependencies](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README.md)
-  - [1204.Last Person to Fit in the Bus](/solution/1200-1299/1204.Last%20Person%20to%20Fit%20in%20the%20Bus/README.md)
-  - [1205.Monthly Transactions II](/solution/1200-1299/1205.Monthly%20Transactions%20II/README.md)
-  - [1206.Design Skiplist](/solution/1200-1299/1206.Design%20Skiplist/README.md)
-  - [1207.Unique Number of Occurrences](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README.md)
-  - [1208.Get Equal Substrings Within Budget](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README.md)
-  - [1209.Remove All Adjacent Duplicates in String II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README.md)
-  - [1210.Minimum Moves to Reach Target with Rotations](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README.md)
-  - [1211.Queries Quality and Percentage](/solution/1200-1299/1211.Queries%20Quality%20and%20Percentage/README.md)
-  - [1212.Team Scores in Football Tournament](/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README.md)
-  - [1213.Intersection of Three Sorted Arrays](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README.md)
-  - [1214.Two Sum BSTs](/solution/1200-1299/1214.Two%20Sum%20BSTs/README.md)
-  - [1215.Stepping Numbers](/solution/1200-1299/1215.Stepping%20Numbers/README.md)
-  - [1216.Valid Palindrome III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README.md)
-  - [1217.Minimum Cost to Move Chips to The Same Position](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README.md)
-  - [1218.Longest Arithmetic Subsequence of Given Difference](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README.md)
-  - [1219.Path with Maximum Gold](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README.md)
-  - [1220.Count Vowels Permutation](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README.md)
-  - [1221.Split a String in Balanced Strings](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README.md)
-  - [1222.Queens That Can Attack the King](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README.md)
-  - [1223.Dice Roll Simulation](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README.md)
-  - [1224.Maximum Equal Frequency](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README.md)
-  - [1225.Report Contiguous Dates](/solution/1200-1299/1225.Report%20Contiguous%20Dates/README.md)
-  - [1226.The Dining Philosophers](/solution/1200-1299/1226.The%20Dining%20Philosophers/README.md)
-  - [1227.Airplane Seat Assignment Probability](/solution/1200-1299/1227.Airplane%20Seat%20Assignment%20Probability/README.md)
-  - [1228.Missing Number In Arithmetic Progression](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README.md)
-  - [1229.Meeting Scheduler](/solution/1200-1299/1229.Meeting%20Scheduler/README.md)
-  - [1230.Toss Strange Coins](/solution/1200-1299/1230.Toss%20Strange%20Coins/README.md)
-  - [1231.Divide Chocolate](/solution/1200-1299/1231.Divide%20Chocolate/README.md)
-  - [1232.Check If It Is a Straight Line](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README.md)
-  - [1233.Remove Sub-Folders from the Filesystem](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README.md)
-  - [1234.Replace the Substring for Balanced String](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README.md)
-  - [1235.Maximum Profit in Job Scheduling](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md)
-  - [1236.Web Crawler](/solution/1200-1299/1236.Web%20Crawler/README.md)
-  - [1237.Find Positive Integer Solution for a Given Equation](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README.md)
-  - [1238.Circular Permutation in Binary Representation](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README.md)
-  - [1239.Maximum Length of a Concatenated String with Unique Characters](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README.md)
-  - [1240.Tiling a Rectangle with the Fewest Squares](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README.md)
-  - [1241.Number of Comments per Post](/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README.md)
-  - [1242.Web Crawler Multithreaded](/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README.md)
-  - [1243.Array Transformation](/solution/1200-1299/1243.Array%20Transformation/README.md)
-  - [1244.Design A Leaderboard](/solution/1200-1299/1244.Design%20A%20Leaderboard/README.md)
-  - [1245.Tree Diameter](/solution/1200-1299/1245.Tree%20Diameter/README.md)
-  - [1246.Palindrome Removal](/solution/1200-1299/1246.Palindrome%20Removal/README.md)
-  - [1247.Minimum Swaps to Make Strings Equal](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README.md)
-  - [1248.Count Number of Nice Subarrays](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README.md)
-  - [1249.Minimum Remove to Make Valid Parentheses](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md)
-  - [1250.Check If It Is a Good Array](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README.md)
-  - [1251.Average Selling Price](/solution/1200-1299/1251.Average%20Selling%20Price/README.md)
-  - [1252.Cells with Odd Values in a Matrix](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README.md)
-  - [1253.Reconstruct a 2-Row Binary Matrix](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README.md)
-  - [1254.Number of Closed Islands](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README.md)
-  - [1255.Maximum Score Words Formed by Letters](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README.md)
-  - [1256.Encode Number](/solution/1200-1299/1256.Encode%20Number/README.md)
-  - [1257.Smallest Common Region](/solution/1200-1299/1257.Smallest%20Common%20Region/README.md)
-  - [1258.Synonymous Sentences](/solution/1200-1299/1258.Synonymous%20Sentences/README.md)
-  - [1259.Handshakes That Don't Cross](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README.md)
-  - [1260.Shift 2D Grid](/solution/1200-1299/1260.Shift%202D%20Grid/README.md)
-  - [1261.Find Elements in a Contaminated Binary Tree](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README.md)
-  - [1262.Greatest Sum Divisible by Three](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README.md)
-  - [1263.Minimum Moves to Move a Box to Their Target Location](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README.md)
-  - [1264.Page Recommendations](/solution/1200-1299/1264.Page%20Recommendations/README.md)
-  - [1265.Print Immutable Linked List in Reverse](/solution/1200-1299/1265.Print%20Immutable%20Linked%20List%20in%20Reverse/README.md)
-  - [1266.Minimum Time Visiting All Points](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README.md)
-  - [1267.Count Servers that Communicate](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README.md)
-  - [1268.Search Suggestions System](/solution/1200-1299/1268.Search%20Suggestions%20System/README.md)
-  - [1269.Number of Ways to Stay in the Same Place After Some Steps](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README.md)
-  - [1270.All People Report to the Given Manager](/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README.md)
-  - [1271.Hexspeak](/solution/1200-1299/1271.Hexspeak/README.md)
-  - [1272.Remove Interval](/solution/1200-1299/1272.Remove%20Interval/README.md)
-  - [1273.Delete Tree Nodes](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README.md)
-  - [1274.Number of Ships in a Rectangle](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README.md)
-  - [1275.Find Winner on a Tic Tac Toe Game](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README.md)
-  - [1276.Number of Burgers with No Waste of Ingredients](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README.md)
-  - [1277.Count Square Submatrices with All Ones](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README.md)
-  - [1278.Palindrome Partitioning III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README.md)
-  - [1279.Traffic Light Controlled Intersection](/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README.md)
-  - [1280.Students and Examinations](/solution/1200-1299/1280.Students%20and%20Examinations/README.md)
-  - [1281.Subtract the Product and Sum of Digits of an Integer](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README.md)
-  - [1282.Group the People Given the Group Size They Belong To](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README.md)
-  - [1283.Find the Smallest Divisor Given a Threshold](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README.md)
-  - [1284.Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README.md)
-  - [1285.Find the Start and End Number of Continuous Ranges](/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README.md)
-  - [1286.Iterator for Combination](/solution/1200-1299/1286.Iterator%20for%20Combination/README.md)
-  - [1287.Element Appearing More Than 25% In Sorted Array](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README.md)
-  - [1288.Remove Covered Intervals](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README.md)
-  - [1289.Minimum Falling Path Sum II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README.md)
-  - [1290.Convert Binary Number in a Linked List to Integer](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README.md)
-  - [1291.Sequential Digits](/solution/1200-1299/1291.Sequential%20Digits/README.md)
-  - [1292.Maximum Side Length of a Square with Sum Less than or Equal to Threshold](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README.md)
-  - [1293.Shortest Path in a Grid with Obstacles Elimination](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README.md)
-  - [1294.Weather Type in Each Country](/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README.md)
-  - [1295.Find Numbers with Even Number of Digits](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README.md)
-  - [1296.Divide Array in Sets of K Consecutive Numbers](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README.md)
-  - [1297.Maximum Number of Occurrences of a Substring](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README.md)
-  - [1298.Maximum Candies You Can Get from Boxes](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README.md)
-  - [1299.Replace Elements with Greatest Element on Right Side](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README.md)
+  - [1200.最小绝对差](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README.md)
+  - [1201.丑数 III](/solution/1200-1299/1201.Ugly%20Number%20III/README.md)
+  - [1202.交换字符串中的元素](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md)
+  - [1203.项目管理](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README.md)
+  - [1204.最后一个能进入电梯的人](/solution/1200-1299/1204.Last%20Person%20to%20Fit%20in%20the%20Bus/README.md)
+  - [1205.每月交易II](/solution/1200-1299/1205.Monthly%20Transactions%20II/README.md)
+  - [1206.设计跳表](/solution/1200-1299/1206.Design%20Skiplist/README.md)
+  - [1207.独一无二的出现次数](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README.md)
+  - [1208.尽可能使字符串相等](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README.md)
+  - [1209.删除字符串中的所有相邻重复项 II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README.md)
+  - [1210.穿过迷宫的最少移动次数](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README.md)
+  - [1211.查询结果的质量和占比](/solution/1200-1299/1211.Queries%20Quality%20and%20Percentage/README.md)
+  - [1212.查询球队积分](/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README.md)
+  - [1213.三个有序数组的交集](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README.md)
+  - [1214.查找两棵二叉搜索树之和](/solution/1200-1299/1214.Two%20Sum%20BSTs/README.md)
+  - [1215.步进数](/solution/1200-1299/1215.Stepping%20Numbers/README.md)
+  - [1216.验证回文字符串 III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README.md)
+  - [1217.玩筹码](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README.md)
+  - [1218.最长定差子序列](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README.md)
+  - [1219.黄金矿工](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README.md)
+  - [1220.统计元音字母序列的数目](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README.md)
+  - [1221.分割平衡字符串](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README.md)
+  - [1222.可以攻击国王的皇后](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README.md)
+  - [1223.掷骰子模拟](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README.md)
+  - [1224.最大相等频率](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README.md)
+  - [1225.报告系统状态的连续日期](/solution/1200-1299/1225.Report%20Contiguous%20Dates/README.md)
+  - [1226.哲学家进餐](/solution/1200-1299/1226.The%20Dining%20Philosophers/README.md)
+  - [1227.飞机座位分配概率](/solution/1200-1299/1227.Airplane%20Seat%20Assignment%20Probability/README.md)
+  - [1228.等差数列中缺失的数字](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README.md)
+  - [1229.安排会议日程](/solution/1200-1299/1229.Meeting%20Scheduler/README.md)
+  - [1230.抛掷硬币](/solution/1200-1299/1230.Toss%20Strange%20Coins/README.md)
+  - [1231.分享巧克力](/solution/1200-1299/1231.Divide%20Chocolate/README.md)
+  - [1232.缀点成线](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README.md)
+  - [1233.删除子文件夹](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README.md)
+  - [1234.替换子串得到平衡字符串](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README.md)
+  - [1235.规划兼职工作](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md)
+  - [1236.网络爬虫](/solution/1200-1299/1236.Web%20Crawler/README.md)
+  - [1237.找出给定方程的正整数解](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README.md)
+  - [1238.循环码排列](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README.md)
+  - [1239.串联字符串的最大长度](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README.md)
+  - [1240.铺瓷砖](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README.md)
+  - [1241.每个帖子的评论数](/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README.md)
+  - [1242.多线程网页爬虫](/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README.md)
+  - [1243.数组变换](/solution/1200-1299/1243.Array%20Transformation/README.md)
+  - [1244.力扣排行榜](/solution/1200-1299/1244.Design%20A%20Leaderboard/README.md)
+  - [1245.树的直径](/solution/1200-1299/1245.Tree%20Diameter/README.md)
+  - [1246.删除回文子数组](/solution/1200-1299/1246.Palindrome%20Removal/README.md)
+  - [1247.交换字符使得字符串相同](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README.md)
+  - [1248.统计「优美子数组」](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README.md)
+  - [1249.移除无效的括号](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md)
+  - [1250.检查「好数组」](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README.md)
+  - [1251.平均售价](/solution/1200-1299/1251.Average%20Selling%20Price/README.md)
+  - [1252.奇数值单元格的数目](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README.md)
+  - [1253.重构 2 行二进制矩阵](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README.md)
+  - [1254.统计封闭岛屿的数目](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README.md)
+  - [1255.得分最高的单词集合](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README.md)
+  - [1256.加密数字](/solution/1200-1299/1256.Encode%20Number/README.md)
+  - [1257.最小公共区域](/solution/1200-1299/1257.Smallest%20Common%20Region/README.md)
+  - [1258.近义词句子](/solution/1200-1299/1258.Synonymous%20Sentences/README.md)
+  - [1259.不相交的握手](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README.md)
+  - [1260.二维网格迁移](/solution/1200-1299/1260.Shift%202D%20Grid/README.md)
+  - [1261.在受污染的二叉树中查找元素](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README.md)
+  - [1262.可被三整除的最大和](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README.md)
+  - [1263.推箱子](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README.md)
+  - [1264.页面推荐](/solution/1200-1299/1264.Page%20Recommendations/README.md)
+  - [1265.逆序打印不可变链表](/solution/1200-1299/1265.Print%20Immutable%20Linked%20List%20in%20Reverse/README.md)
+  - [1266.访问所有点的最小时间](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README.md)
+  - [1267.统计参与通信的服务器](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README.md)
+  - [1268.搜索推荐系统](/solution/1200-1299/1268.Search%20Suggestions%20System/README.md)
+  - [1269.停在原地的方案数](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README.md)
+  - [1270.向公司CEO汇报工作的所有人](/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README.md)
+  - [1271.十六进制魔术数字](/solution/1200-1299/1271.Hexspeak/README.md)
+  - [1272.删除区间](/solution/1200-1299/1272.Remove%20Interval/README.md)
+  - [1273.删除树节点](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README.md)
+  - [1274.矩形内船只的数目](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README.md)
+  - [1275.找出井字棋的获胜者](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README.md)
+  - [1276.不浪费原料的汉堡制作方案](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README.md)
+  - [1277.统计全为 1 的正方形子矩阵](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README.md)
+  - [1278.分割回文串 III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README.md)
+  - [1279.红绿灯路口](/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README.md)
+  - [1280.学生们参加各科测试的次数](/solution/1200-1299/1280.Students%20and%20Examinations/README.md)
+  - [1281.整数的各位积和之差](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README.md)
+  - [1282.用户分组](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README.md)
+  - [1283.使结果不超过阈值的最小除数](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README.md)
+  - [1284.转化为全零矩阵的最少反转次数](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README.md)
+  - [1285.找到连续区间的开始和结束数字](/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README.md)
+  - [1286.字母组合迭代器](/solution/1200-1299/1286.Iterator%20for%20Combination/README.md)
+  - [1287.有序数组中出现次数超过25%的元素](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README.md)
+  - [1288.删除被覆盖区间](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README.md)
+  - [1289.下降路径最小和  II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README.md)
+  - [1290.二进制链表转整数](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README.md)
+  - [1291.顺次数](/solution/1200-1299/1291.Sequential%20Digits/README.md)
+  - [1292.元素和小于等于阈值的正方形的最大边长](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README.md)
+  - [1293.网格中的最短路径](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README.md)
+  - [1294.不同国家的天气类型](/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README.md)
+  - [1295.统计位数为偶数的数字](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README.md)
+  - [1296.划分数组为连续数字的集合](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README.md)
+  - [1297.子串的最大出现次数](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README.md)
+  - [1298.你能从盒子里获得的最大糖果数](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README.md)
+  - [1299.将每个元素替换为右侧最大元素](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README.md)
 
 - 1300-1399
-  - [1300.Sum of Mutated Array Closest to Target](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README.md)
-  - [1301.Number of Paths with Max Score](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README.md)
-  - [1302.Deepest Leaves Sum](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README.md)
-  - [1303.Find the Team Size](/solution/1300-1399/1303.Find%20the%20Team%20Size/README.md)
-  - [1304.Find N Unique Integers Sum up to Zero](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README.md)
-  - [1305.All Elements in Two Binary Search Trees](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README.md)
-  - [1306.Jump Game III](/solution/1300-1399/1306.Jump%20Game%20III/README.md)
-  - [1307.Verbal Arithmetic Puzzle](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README.md)
-  - [1308.Running Total for Different Genders](/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README.md)
-  - [1309.Decrypt String from Alphabet to Integer Mapping](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README.md)
-  - [1310.XOR Queries of a Subarray](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README.md)
-  - [1311.Get Watched Videos by Your Friends](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README.md)
-  - [1312.Minimum Insertion Steps to Make a String Palindrome](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README.md)
-  - [1313.Decompress Run-Length Encoded List](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README.md)
-  - [1314.Matrix Block Sum](/solution/1300-1399/1314.Matrix%20Block%20Sum/README.md)
-  - [1315.Sum of Nodes with Even-Valued Grandparent](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README.md)
-  - [1316.Distinct Echo Substrings](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README.md)
-  - [1317.Convert Integer to the Sum of Two No-Zero Integers](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README.md)
-  - [1318.Minimum Flips to Make a OR b Equal to c](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README.md)
-  - [1319.Number of Operations to Make Network Connected](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README.md)
-  - [1320.Minimum Distance to Type a Word Using Two Fingers](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README.md)
-  - [1321.Restaurant Growth](/solution/1300-1399/1321.Restaurant%20Growth/README.md)
-  - [1322.Ads Performance](/solution/1300-1399/1322.Ads%20Performance/README.md)
-  - [1323.Maximum 69 Number](/solution/1300-1399/1323.Maximum%2069%20Number/README.md)
-  - [1324.Print Words Vertically](/solution/1300-1399/1324.Print%20Words%20Vertically/README.md)
-  - [1325.Delete Leaves With a Given Value](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README.md)
-  - [1326.Minimum Number of Taps to Open to Water a Garden](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md)
-  - [1327.List the Products Ordered in a Period](/solution/1300-1399/1327.List%20the%20Products%20Ordered%20in%20a%20Period/README.md)
-  - [1328.Break a Palindrome](/solution/1300-1399/1328.Break%20a%20Palindrome/README.md)
-  - [1329.Sort the Matrix Diagonally](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README.md)
-  - [1330.Reverse Subarray To Maximize Array Value](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README.md)
-  - [1331.Rank Transform of an Array](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README.md)
-  - [1332.Remove Palindromic Subsequences](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README.md)
-  - [1333.Filter Restaurants by Vegan-Friendly, Price and Distance](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README.md)
-  - [1334.Find the City With the Smallest Number of Neighbors at a Threshold Distance](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README.md)
-  - [1335.Minimum Difficulty of a Job Schedule](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README.md)
-  - [1336.Number of Transactions per Visit](/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README.md)
-  - [1337.The K Weakest Rows in a Matrix](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README.md)
-  - [1338.Reduce Array Size to The Half](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README.md)
-  - [1339.Maximum Product of Splitted Binary Tree](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README.md)
-  - [1340.Jump Game V](/solution/1300-1399/1340.Jump%20Game%20V/README.md)
-  - [1341.Movie Rating](/solution/1300-1399/1341.Movie%20Rating/README.md)
-  - [1342.Number of Steps to Reduce a Number to Zero](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README.md)
-  - [1343.Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README.md)
-  - [1344.Angle Between Hands of a Clock](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README.md)
-  - [1345.Jump Game IV](/solution/1300-1399/1345.Jump%20Game%20IV/README.md)
-  - [1346.Check If N and Its Double Exist](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README.md)
-  - [1347.Minimum Number of Steps to Make Two Strings Anagram](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README.md)
-  - [1348.Tweet Counts Per Frequency](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README.md)
-  - [1349.Maximum Students Taking Exam](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README.md)
-  - [1350.Students With Invalid Departments](/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README.md)
-  - [1351.Count Negative Numbers in a Sorted Matrix](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README.md)
-  - [1352.Product of the Last K Numbers](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README.md)
-  - [1353.Maximum Number of Events That Can Be Attended](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README.md)
-  - [1354.Construct Target Array With Multiple Sums](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README.md)
-  - [1355.Activity Participants](/solution/1300-1399/1355.Activity%20Participants/README.md)
-  - [1356.Sort Integers by The Number of 1 Bits](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README.md)
-  - [1357.Apply Discount Every n Orders](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README.md)
-  - [1358.Number of Substrings Containing All Three Characters](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README.md)
-  - [1359.Count All Valid Pickup and Delivery Options](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README.md)
-  - [1360.Number of Days Between Two Dates](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README.md)
-  - [1361.Validate Binary Tree Nodes](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README.md)
-  - [1362.Closest Divisors](/solution/1300-1399/1362.Closest%20Divisors/README.md)
-  - [1363.Largest Multiple of Three](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README.md)
-  - [1364.Number of Trusted Contacts of a Customer](/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README.md)
-  - [1365.How Many Numbers Are Smaller Than the Current Number](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README.md)
-  - [1366.Rank Teams by Votes](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README.md)
-  - [1367.Linked List in Binary Tree](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README.md)
-  - [1368.Minimum Cost to Make at Least One Valid Path in a Grid](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md)
-  - [1369.Get the Second Most Recent Activity](/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README.md)
-  - [1370.Increasing Decreasing String](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README.md)
-  - [1371.Find the Longest Substring Containing Vowels in Even Counts](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README.md)
-  - [1372.Longest ZigZag Path in a Binary Tree](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README.md)
-  - [1373.Maximum Sum BST in Binary Tree](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README.md)
-  - [1374.Generate a String With Characters That Have Odd Counts](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README.md)
-  - [1375.Number of Times Binary String Is Prefix-Aligned](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README.md)
-  - [1376.Time Needed to Inform All Employees](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md)
-  - [1377.Frog Position After T Seconds](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md)
-  - [1378.Replace Employee ID With The Unique Identifier](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README.md)
+  - [1300.转变数组后最接近目标值的数组和](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README.md)
+  - [1301.最大得分的路径数目](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README.md)
+  - [1302.层数最深叶子节点的和](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README.md)
+  - [1303.求团队人数](/solution/1300-1399/1303.Find%20the%20Team%20Size/README.md)
+  - [1304.和为零的N个唯一整数](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README.md)
+  - [1305.两棵二叉搜索树中的所有元素](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README.md)
+  - [1306.跳跃游戏 III](/solution/1300-1399/1306.Jump%20Game%20III/README.md)
+  - [1307.口算难题](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README.md)
+  - [1308.不同性别每日分数总计](/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README.md)
+  - [1309.解码字母到整数映射](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README.md)
+  - [1310.子数组异或查询](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README.md)
+  - [1311.获取你好友已观看的视频](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README.md)
+  - [1312.让字符串成为回文串的最少插入次数](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README.md)
+  - [1313.解压缩编码列表](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README.md)
+  - [1314.矩阵区域和](/solution/1300-1399/1314.Matrix%20Block%20Sum/README.md)
+  - [1315.祖父节点值为偶数的节点和](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README.md)
+  - [1316.不同的循环子字符串](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README.md)
+  - [1317.将整数转换为两个无零整数的和](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README.md)
+  - [1318.或运算的最小翻转次数](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README.md)
+  - [1319.连通网络的操作次数](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README.md)
+  - [1320.二指输入的的最小距离](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README.md)
+  - [1321.餐馆营业额变化增长](/solution/1300-1399/1321.Restaurant%20Growth/README.md)
+  - [1322.广告效果](/solution/1300-1399/1322.Ads%20Performance/README.md)
+  - [1323.6 和 9 组成的最大数字](/solution/1300-1399/1323.Maximum%2069%20Number/README.md)
+  - [1324.竖直打印单词](/solution/1300-1399/1324.Print%20Words%20Vertically/README.md)
+  - [1325.删除给定值的叶子节点](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README.md)
+  - [1326.灌溉花园的最少水龙头数目](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md)
+  - [1327.列出指定时间段内所有的下单产品](/solution/1300-1399/1327.List%20the%20Products%20Ordered%20in%20a%20Period/README.md)
+  - [1328.破坏回文串](/solution/1300-1399/1328.Break%20a%20Palindrome/README.md)
+  - [1329.将矩阵按对角线排序](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README.md)
+  - [1330.翻转子数组得到最大的数组值](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README.md)
+  - [1331.数组序号转换](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README.md)
+  - [1332.删除回文子序列](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README.md)
+  - [1333.餐厅过滤器](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README.md)
+  - [1334.阈值距离内邻居最少的城市](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README.md)
+  - [1335.工作计划的最低难度](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README.md)
+  - [1336.每次访问的交易次数](/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README.md)
+  - [1337.矩阵中战斗力最弱的 K 行](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README.md)
+  - [1338.数组大小减半](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README.md)
+  - [1339.分裂二叉树的最大乘积](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README.md)
+  - [1340.跳跃游戏 V](/solution/1300-1399/1340.Jump%20Game%20V/README.md)
+  - [1341.电影评分](/solution/1300-1399/1341.Movie%20Rating/README.md)
+  - [1342.将数字变成 0 的操作次数](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README.md)
+  - [1343.大小为 K 且平均值大于等于阈值的子数组数目](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README.md)
+  - [1344.时钟指针的夹角](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README.md)
+  - [1345.跳跃游戏 IV](/solution/1300-1399/1345.Jump%20Game%20IV/README.md)
+  - [1346.检查整数及其两倍数是否存在](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README.md)
+  - [1347.制造字母异位词的最小步骤数](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README.md)
+  - [1348.推文计数](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README.md)
+  - [1349.参加考试的最大学生数](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README.md)
+  - [1350.院系无效的学生](/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README.md)
+  - [1351.统计有序矩阵中的负数](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README.md)
+  - [1352.最后 K 个数的乘积](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README.md)
+  - [1353.最多可以参加的会议数目](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README.md)
+  - [1354.多次求和构造目标数组](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README.md)
+  - [1355.活动参与者](/solution/1300-1399/1355.Activity%20Participants/README.md)
+  - [1356.根据数字二进制下 1 的数目排序](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README.md)
+  - [1357.每隔 n 个顾客打折](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README.md)
+  - [1358.包含所有三种字符的子字符串数目](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README.md)
+  - [1359.有效的快递序列数目](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README.md)
+  - [1360.日期之间隔几天](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README.md)
+  - [1361.验证二叉树](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README.md)
+  - [1362.最接近的因数](/solution/1300-1399/1362.Closest%20Divisors/README.md)
+  - [1363.形成三的最大倍数](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README.md)
+  - [1364.顾客的可信联系人数量](/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README.md)
+  - [1365.有多少小于当前数字的数字](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README.md)
+  - [1366.通过投票对团队排名](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README.md)
+  - [1367.二叉树中的列表](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README.md)
+  - [1368.使网格图至少有一条有效路径的最小代价](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md)
+  - [1369.获取最近第二次的活动](/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README.md)
+  - [1370.上升下降字符串](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README.md)
+  - [1371.每个元音包含偶数次的最长子字符串](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README.md)
+  - [1372.二叉树中的最长交错路径](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README.md)
+  - [1373.二叉搜索子树的最大键值和](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README.md)
+  - [1374.生成每种字符都是奇数个的字符串](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README.md)
+  - [1375.二进制字符串前缀一致的次数](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README.md)
+  - [1376.通知所有员工所需的时间](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md)
+  - [1377.T 秒后青蛙的位置](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md)
+  - [1378.使用唯一标识码替换员工ID](/solution/1300-1399/1378.Replace%20Employee%20ID%20With%20The%20Unique%20Identifier/README.md)
   - [1379.Find a Corresponding Node of a Binary Tree in a Clone of That Tree](/solution/1300-1399/1379.Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree/README.md)
-  - [1380.Lucky Numbers in a Matrix](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md)
-  - [1381.Design a Stack With Increment Operation](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md)
-  - [1382.Balance a Binary Search Tree](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md)
-  - [1383.Maximum Performance of a Team](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README.md)
-  - [1384.Total Sales Amount by Year](/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README.md)
-  - [1385.Find the Distance Value Between Two Arrays](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README.md)
-  - [1386.Cinema Seat Allocation](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README.md)
-  - [1387.Sort Integers by The Power Value](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README.md)
-  - [1388.Pizza With 3n Slices](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README.md)
-  - [1389.Create Target Array in the Given Order](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README.md)
-  - [1390.Four Divisors](/solution/1300-1399/1390.Four%20Divisors/README.md)
-  - [1391.Check if There is a Valid Path in a Grid](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README.md)
-  - [1392.Longest Happy Prefix](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README.md)
-  - [1393.Capital GainLoss](/solution/1300-1399/1393.Capital%20GainLoss/README.md)
-  - [1394.Find Lucky Integer in an Array](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README.md)
-  - [1395.Count Number of Teams](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README.md)
-  - [1396.Design Underground System](/solution/1300-1399/1396.Design%20Underground%20System/README.md)
-  - [1397.Find All Good Strings](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README.md)
-  - [1398.Customers Who Bought Products A and B but Not C](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README.md)
-  - [1399.Count Largest Group](/solution/1300-1399/1399.Count%20Largest%20Group/README.md)
+  - [1380.矩阵中的幸运数](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md)
+  - [1381.设计一个支持增量操作的栈](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md)
+  - [1382.将二叉搜索树变平衡](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md)
+  - [1383.最大的团队表现值](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README.md)
+  - [1384.按年度列出销售总额](/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README.md)
+  - [1385.两个数组间的距离值](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README.md)
+  - [1386.安排电影院座位](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README.md)
+  - [1387.将整数按权重排序](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README.md)
+  - [1388.3n 块披萨](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README.md)
+  - [1389.按既定顺序创建目标数组](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README.md)
+  - [1390.四因数](/solution/1300-1399/1390.Four%20Divisors/README.md)
+  - [1391.检查网格中是否存在有效路径](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README.md)
+  - [1392.最长快乐前缀](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README.md)
+  - [1393.股票的资本损益](/solution/1300-1399/1393.Capital%20GainLoss/README.md)
+  - [1394.找出数组中的幸运数](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README.md)
+  - [1395.统计作战单位数](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README.md)
+  - [1396.设计地铁系统](/solution/1300-1399/1396.Design%20Underground%20System/README.md)
+  - [1397.找到所有好字符串](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README.md)
+  - [1398.购买了产品 A 和产品 B 却没有购买产品 C 的顾客](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README.md)
+  - [1399.统计最大组的数目](/solution/1300-1399/1399.Count%20Largest%20Group/README.md)
 
 - 1400-1499
-  - [1400.Construct K Palindrome Strings](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md)
+  - [1400.构造 K 个回文字符串](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md)
   - [1401.Circle and Rectangle Overlapping](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md)
-  - [1402.Reducing Dishes](/solution/1400-1499/1402.Reducing%20Dishes/README.md)
-  - [1403.Minimum Subsequence in Non-Increasing Order](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md)
-  - [1404.Number of Steps to Reduce a Number in Binary Representation to One](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md)
-  - [1405.Longest Happy String](/solution/1400-1499/1405.Longest%20Happy%20String/README.md)
-  - [1406.Stone Game III](/solution/1400-1499/1406.Stone%20Game%20III/README.md)
-  - [1407.Top Travellers](/solution/1400-1499/1407.Top%20Travellers/README.md)
-  - [1408.String Matching in an Array](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README.md)
-  - [1409.Queries on a Permutation With Key](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README.md)
-  - [1410.HTML Entity Parser](/solution/1400-1499/1410.HTML%20Entity%20Parser/README.md)
-  - [1411.Number of Ways to Paint N × 3 Grid](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README.md)
-  - [1412.Find the Quiet Students in All Exams](/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README.md)
-  - [1413.Minimum Value to Get Positive Step by Step Sum](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README.md)
-  - [1414.Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README.md)
-  - [1415.The k-th Lexicographical String of All Happy Strings of Length n](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README.md)
-  - [1416.Restore The Array](/solution/1400-1499/1416.Restore%20The%20Array/README.md)
-  - [1417.Reformat The String](/solution/1400-1499/1417.Reformat%20The%20String/README.md)
-  - [1418.Display Table of Food Orders in a Restaurant](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README.md)
-  - [1419.Minimum Number of Frogs Croaking](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README.md)
-  - [1420.Build Array Where You Can Find The Maximum Exactly K Comparisons](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README.md)
-  - [1421.NPV Queries](/solution/1400-1499/1421.NPV%20Queries/README.md)
-  - [1422.Maximum Score After Splitting a String](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README.md)
-  - [1423.Maximum Points You Can Obtain from Cards](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README.md)
-  - [1424.Diagonal Traverse II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README.md)
-  - [1425.Constrained Subsequence Sum](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README.md)
-  - [1426.Counting Elements](/solution/1400-1499/1426.Counting%20Elements/README.md)
-  - [1427.Perform String Shifts](/solution/1400-1499/1427.Perform%20String%20Shifts/README.md)
-  - [1428.Leftmost Column with at Least a One](/solution/1400-1499/1428.Leftmost%20Column%20with%20at%20Least%20a%20One/README.md)
-  - [1429.First Unique Number](/solution/1400-1499/1429.First%20Unique%20Number/README.md)
-  - [1430.Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree](/solution/1400-1499/1430.Check%20If%20a%20String%20Is%20a%20Valid%20Sequence%20from%20Root%20to%20Leaves%20Path%20in%20a%20Binary%20Tree/README.md)
-  - [1431.Kids With the Greatest Number of Candies](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README.md)
-  - [1432.Max Difference You Can Get From Changing an Integer](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README.md)
-  - [1433.Check If a String Can Break Another String](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README.md)
-  - [1434.Number of Ways to Wear Different Hats to Each Other](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README.md)
-  - [1435.Create a Session Bar Chart](/solution/1400-1499/1435.Create%20a%20Session%20Bar%20Chart/README.md)
-  - [1436.Destination City](/solution/1400-1499/1436.Destination%20City/README.md)
-  - [1437.Check If All 1's Are at Least Length K Places Away](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README.md)
-  - [1438.Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README.md)
-  - [1439.Find the Kth Smallest Sum of a Matrix With Sorted Rows](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README.md)
-  - [1440.Evaluate Boolean Expression](/solution/1400-1499/1440.Evaluate%20Boolean%20Expression/README.md)
-  - [1441.Build an Array With Stack Operations](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README.md)
-  - [1442.Count Triplets That Can Form Two Arrays of Equal XOR](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README.md)
-  - [1443.Minimum Time to Collect All Apples in a Tree](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README.md)
-  - [1444.Number of Ways of Cutting a Pizza](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md)
-  - [1445.Apples & Oranges](/solution/1400-1499/1445.Apples%20%26%20Oranges/README.md)
-  - [1446.Consecutive Characters](/solution/1400-1499/1446.Consecutive%20Characters/README.md)
-  - [1447.Simplified Fractions](/solution/1400-1499/1447.Simplified%20Fractions/README.md)
-  - [1448.Count Good Nodes in Binary Tree](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README.md)
-  - [1449.Form Largest Integer With Digits That Add up to Target](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README.md)
-  - [1450.Number of Students Doing Homework at a Given Time](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README.md)
-  - [1451.Rearrange Words in a Sentence](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README.md)
-  - [1452.People Whose List of Favorite Companies Is Not a Subset of Another List](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README.md)
-  - [1453.Maximum Number of Darts Inside of a Circular Dartboard](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README.md)
-  - [1454.Active Users](/solution/1400-1499/1454.Active%20Users/README.md)
-  - [1455.Check If a Word Occurs As a Prefix of Any Word in a Sentence](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README.md)
-  - [1456.Maximum Number of Vowels in a Substring of Given Length](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README.md)
-  - [1457.Pseudo-Palindromic Paths in a Binary Tree](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README.md)
-  - [1458.Max Dot Product of Two Subsequences](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README.md)
-  - [1459.Rectangles Area](/solution/1400-1499/1459.Rectangles%20Area/README.md)
-  - [1460.Make Two Arrays Equal by Reversing Sub-arrays](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Sub-arrays/README.md)
-  - [1461.Check If a String Contains All Binary Codes of Size K](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README.md)
-  - [1462.Course Schedule IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README.md)
-  - [1463.Cherry Pickup II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README.md)
-  - [1464.Maximum Product of Two Elements in an Array](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README.md)
-  - [1465.Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README.md)
-  - [1466.Reorder Routes to Make All Paths Lead to the City Zero](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README.md)
-  - [1467.Probability of a Two Boxes Having The Same Number of Distinct Balls](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README.md)
-  - [1468.Calculate Salaries](/solution/1400-1499/1468.Calculate%20Salaries/README.md)
-  - [1469.Find All The Lonely Nodes](/solution/1400-1499/1469.Find%20All%20The%20Lonely%20Nodes/README.md)
-  - [1470.Shuffle the Array](/solution/1400-1499/1470.Shuffle%20the%20Array/README.md)
-  - [1471.The k Strongest Values in an Array](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README.md)
-  - [1472.Design Browser History](/solution/1400-1499/1472.Design%20Browser%20History/README.md)
-  - [1473.Paint House III](/solution/1400-1499/1473.Paint%20House%20III/README.md)
-  - [1474.Delete N Nodes After M Nodes of a Linked List](/solution/1400-1499/1474.Delete%20N%20Nodes%20After%20M%20Nodes%20of%20a%20Linked%20List/README.md)
-  - [1475.Final Prices With a Special Discount in a Shop](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README.md)
-  - [1476.Subrectangle Queries](/solution/1400-1499/1476.Subrectangle%20Queries/README.md)
-  - [1477.Find Two Non-overlapping Sub-arrays Each With Target Sum](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README.md)
-  - [1478.Allocate Mailboxes](/solution/1400-1499/1478.Allocate%20Mailboxes/README.md)
-  - [1479.Sales by Day of the Week](/solution/1400-1499/1479.Sales%20by%20Day%20of%20the%20Week/README.md)
-  - [1480.Running Sum of 1d Array](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README.md)
-  - [1481.Least Number of Unique Integers after K Removals](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README.md)
-  - [1482.Minimum Number of Days to Make m Bouquets](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README.md)
-  - [1483.Kth Ancestor of a Tree Node](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md)
-  - [1484.Group Sold Products By The Date](/solution/1400-1499/1484.Group%20Sold%20Products%20By%20The%20Date/README.md)
-  - [1485.Clone Binary Tree With Random Pointer](/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README.md)
-  - [1486.XOR Operation in an Array](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README.md)
-  - [1487.Making File Names Unique](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README.md)
-  - [1488.Avoid Flood in The City](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README.md)
-  - [1489.Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README.md)
-  - [1490.Clone N-ary Tree](/solution/1400-1499/1490.Clone%20N-ary%20Tree/README.md)
-  - [1491.Average Salary Excluding the Minimum and Maximum Salary](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README.md)
-  - [1492.The kth Factor of n](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README.md)
-  - [1493.Longest Subarray of 1's After Deleting One Element](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README.md)
-  - [1494.Parallel Courses II](/solution/1400-1499/1494.Parallel%20Courses%20II/README.md)
-  - [1495.Friendly Movies Streamed Last Month](/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README.md)
-  - [1496.Path Crossing](/solution/1400-1499/1496.Path%20Crossing/README.md)
-  - [1497.Check If Array Pairs Are Divisible by k](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README.md)
-  - [1498.Number of Subsequences That Satisfy the Given Sum Condition](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README.md)
-  - [1499.Max Value of Equation](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README.md)
+  - [1402.做菜顺序](/solution/1400-1499/1402.Reducing%20Dishes/README.md)
+  - [1403.非递增顺序的最小子序列](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md)
+  - [1404.将二进制表示减到 1 的步骤数](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md)
+  - [1405.最长快乐字符串](/solution/1400-1499/1405.Longest%20Happy%20String/README.md)
+  - [1406.石子游戏 III](/solution/1400-1499/1406.Stone%20Game%20III/README.md)
+  - [1407.排名靠前的旅行者](/solution/1400-1499/1407.Top%20Travellers/README.md)
+  - [1408.数组中的字符串匹配](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README.md)
+  - [1409.查询带键的排列](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README.md)
+  - [1410.HTML 实体解析器](/solution/1400-1499/1410.HTML%20Entity%20Parser/README.md)
+  - [1411.给 N x 3 网格图涂色的方案数](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README.md)
+  - [1412.查找成绩处于中游的学生](/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README.md)
+  - [1413.逐步求和得到正数的最小值](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README.md)
+  - [1414.和为 K 的最少斐波那契数字数目](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README.md)
+  - [1415.长度为 n 的开心字符串中字典序第 k 小的字符串](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README.md)
+  - [1416.恢复数组](/solution/1400-1499/1416.Restore%20The%20Array/README.md)
+  - [1417.重新格式化字符串](/solution/1400-1499/1417.Reformat%20The%20String/README.md)
+  - [1418.点菜展示表](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README.md)
+  - [1419.数青蛙](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README.md)
+  - [1420.生成数组](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README.md)
+  - [1421.净现值查询](/solution/1400-1499/1421.NPV%20Queries/README.md)
+  - [1422.分割字符串的最大得分](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README.md)
+  - [1423.可获得的最大点数](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README.md)
+  - [1424.对角线遍历 II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README.md)
+  - [1425.带限制的子序列和](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README.md)
+  - [1426.数元素](/solution/1400-1499/1426.Counting%20Elements/README.md)
+  - [1427.字符串的左右移](/solution/1400-1499/1427.Perform%20String%20Shifts/README.md)
+  - [1428.至少有一个 1 的最左端列](/solution/1400-1499/1428.Leftmost%20Column%20with%20at%20Least%20a%20One/README.md)
+  - [1429.第一个唯一数字](/solution/1400-1499/1429.First%20Unique%20Number/README.md)
+  - [1430.判断给定的序列是否是二叉树从根到叶的路径](/solution/1400-1499/1430.Check%20If%20a%20String%20Is%20a%20Valid%20Sequence%20from%20Root%20to%20Leaves%20Path%20in%20a%20Binary%20Tree/README.md)
+  - [1431.拥有最多糖果的孩子](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README.md)
+  - [1432.改变一个整数能得到的最大差值](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README.md)
+  - [1433.检查一个字符串是否可以打破另一个字符串](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README.md)
+  - [1434.每个人戴不同帽子的方案数](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README.md)
+  - [1435.制作会话柱状图](/solution/1400-1499/1435.Create%20a%20Session%20Bar%20Chart/README.md)
+  - [1436.旅行终点站](/solution/1400-1499/1436.Destination%20City/README.md)
+  - [1437.是否所有 1 都至少相隔 k 个元素](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README.md)
+  - [1438.绝对差不超过限制的最长连续子数组](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README.md)
+  - [1439.有序矩阵中的第 k 个最小数组和](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README.md)
+  - [1440.计算布尔表达式的值](/solution/1400-1499/1440.Evaluate%20Boolean%20Expression/README.md)
+  - [1441.用栈操作构建数组](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README.md)
+  - [1442.形成两个异或相等数组的三元组数目](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README.md)
+  - [1443.收集树上所有苹果的最少时间](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README.md)
+  - [1444.切披萨的方案数](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md)
+  - [1445.苹果和桔子](/solution/1400-1499/1445.Apples%20%26%20Oranges/README.md)
+  - [1446.连续字符](/solution/1400-1499/1446.Consecutive%20Characters/README.md)
+  - [1447.最简分数](/solution/1400-1499/1447.Simplified%20Fractions/README.md)
+  - [1448.统计二叉树中好节点的数目](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README.md)
+  - [1449.数位成本和为目标值的最大数字](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README.md)
+  - [1450.在既定时间做作业的学生人数](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README.md)
+  - [1451.重新排列句子中的单词](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README.md)
+  - [1452.收藏清单](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README.md)
+  - [1453.圆形靶内的最大飞镖数量](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README.md)
+  - [1454.活跃用户](/solution/1400-1499/1454.Active%20Users/README.md)
+  - [1455.检查单词是否为句中其他单词的前缀](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README.md)
+  - [1456.定长子串中元音的最大数目](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README.md)
+  - [1457.二叉树中的伪回文路径](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README.md)
+  - [1458.两个子序列的最大点积](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README.md)
+  - [1459.矩形面积](/solution/1400-1499/1459.Rectangles%20Area/README.md)
+  - [1460.通过翻转子数组使两个数组相等](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Sub-arrays/README.md)
+  - [1461.检查一个字符串是否包含所有长度为 K 的二进制子串](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README.md)
+  - [1462.课程表 IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README.md)
+  - [1463.摘樱桃 II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README.md)
+  - [1464.数组中两元素的最大乘积](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README.md)
+  - [1465.切割后面积最大的蛋糕](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README.md)
+  - [1466.重新规划路线](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README.md)
+  - [1467.两个盒子中球的颜色数相同的概率](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README.md)
+  - [1468.计算税后工资](/solution/1400-1499/1468.Calculate%20Salaries/README.md)
+  - [1469.寻找所有的独生节点](/solution/1400-1499/1469.Find%20All%20The%20Lonely%20Nodes/README.md)
+  - [1470.重新排列数组](/solution/1400-1499/1470.Shuffle%20the%20Array/README.md)
+  - [1471.数组中的 k 个最强值](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README.md)
+  - [1472.设计浏览器历史记录](/solution/1400-1499/1472.Design%20Browser%20History/README.md)
+  - [1473.粉刷房子 III](/solution/1400-1499/1473.Paint%20House%20III/README.md)
+  - [1474.删除链表 M 个节点之后的 N 个节点](/solution/1400-1499/1474.Delete%20N%20Nodes%20After%20M%20Nodes%20of%20a%20Linked%20List/README.md)
+  - [1475.商品折扣后的最终价格](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README.md)
+  - [1476.子矩形查询](/solution/1400-1499/1476.Subrectangle%20Queries/README.md)
+  - [1477.找两个和为目标值且不重叠的子数组](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README.md)
+  - [1478.安排邮筒](/solution/1400-1499/1478.Allocate%20Mailboxes/README.md)
+  - [1479.周内每天的销售情况](/solution/1400-1499/1479.Sales%20by%20Day%20of%20the%20Week/README.md)
+  - [1480.一维数组的动态和](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README.md)
+  - [1481.不同整数的最少数目](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README.md)
+  - [1482.制作 m 束花所需的最少天数](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README.md)
+  - [1483.树节点的第 K 个祖先](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md)
+  - [1484.按日期分组销售产品](/solution/1400-1499/1484.Group%20Sold%20Products%20By%20The%20Date/README.md)
+  - [1485.克隆含随机指针的二叉树](/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README.md)
+  - [1486.数组异或操作](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README.md)
+  - [1487.保证文件名唯一](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README.md)
+  - [1488.避免洪水泛滥](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README.md)
+  - [1489.找到最小生成树里的关键边和伪关键边](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README.md)
+  - [1490.克隆 N 叉树](/solution/1400-1499/1490.Clone%20N-ary%20Tree/README.md)
+  - [1491.去掉最低工资和最高工资后的工资平均值](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README.md)
+  - [1492.n 的第 k 个因子](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README.md)
+  - [1493.删掉一个元素以后全为 1 的最长子数组](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README.md)
+  - [1494.并行课程 II](/solution/1400-1499/1494.Parallel%20Courses%20II/README.md)
+  - [1495.上月播放的儿童适宜电影](/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README.md)
+  - [1496.判断路径是否相交](/solution/1400-1499/1496.Path%20Crossing/README.md)
+  - [1497.检查数组对是否可以被 k 整除](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README.md)
+  - [1498.满足条件的子序列数目](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README.md)
+  - [1499.满足不等式的最大值](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README.md)
 
 - 1500-1599
-  - [1500.Design a File Sharing System](/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README.md)
-  - [1501.Countries You Can Safely Invest In](/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README.md)
-  - [1502.Can Make Arithmetic Progression From Sequence](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README.md)
-  - [1503.Last Moment Before All Ants Fall Out of a Plank](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README.md)
-  - [1504.Count Submatrices With All Ones](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README.md)
-  - [1505.Minimum Possible Integer After at Most K Adjacent Swaps On Digits](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README.md)
-  - [1506.Find Root of N-Ary Tree](/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/README.md)
-  - [1507.Reformat Date](/solution/1500-1599/1507.Reformat%20Date/README.md)
-  - [1508.Range Sum of Sorted Subarray Sums](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README.md)
-  - [1509.Minimum Difference Between Largest and Smallest Value in Three Moves](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README.md)
-  - [1510.Stone Game IV](/solution/1500-1599/1510.Stone%20Game%20IV/README.md)
-  - [1511.Customer Order Frequency](/solution/1500-1599/1511.Customer%20Order%20Frequency/README.md)
-  - [1512.Number of Good Pairs](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README.md)
-  - [1513.Number of Substrings With Only 1s](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md)
-  - [1514.Path with Maximum Probability](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README.md)
-  - [1515.Best Position for a Service Centre](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README.md)
-  - [1516.Move Sub-Tree of N-Ary Tree](/solution/1500-1599/1516.Move%20Sub-Tree%20of%20N-Ary%20Tree/README.md)
-  - [1517.Find Users With Valid E-Mails](/solution/1500-1599/1517.Find%20Users%20With%20Valid%20E-Mails/README.md)
-  - [1518.Water Bottles](/solution/1500-1599/1518.Water%20Bottles/README.md)
-  - [1519.Number of Nodes in the Sub-Tree With the Same Label](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README.md)
-  - [1520.Maximum Number of Non-Overlapping Substrings](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README.md)
-  - [1521.Find a Value of a Mysterious Function Closest to Target](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README.md)
-  - [1522.Diameter of N-Ary Tree](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md)
-  - [1523.Count Odd Numbers in an Interval Range](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README.md)
-  - [1524.Number of Sub-arrays With Odd Sum](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README.md)
-  - [1525.Number of Good Ways to Split a String](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README.md)
-  - [1526.Minimum Number of Increments on Subarrays to Form a Target Array](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README.md)
-  - [1527.Patients With a Condition](/solution/1500-1599/1527.Patients%20With%20a%20Condition/README.md)
-  - [1528.Shuffle String](/solution/1500-1599/1528.Shuffle%20String/README.md)
-  - [1529.Minimum Suffix Flips](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README.md)
-  - [1530.Number of Good Leaf Nodes Pairs](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README.md)
-  - [1531.String Compression II](/solution/1500-1599/1531.String%20Compression%20II/README.md)
-  - [1532.The Most Recent Three Orders](/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README.md)
-  - [1533.Find the Index of the Large Integer](/solution/1500-1599/1533.Find%20the%20Index%20of%20the%20Large%20Integer/README.md)
-  - [1534.Count Good Triplets](/solution/1500-1599/1534.Count%20Good%20Triplets/README.md)
-  - [1535.Find the Winner of an Array Game](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README.md)
-  - [1536.Minimum Swaps to Arrange a Binary Grid](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README.md)
-  - [1537.Get the Maximum Score](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README.md)
-  - [1538.Guess the Majority in a Hidden Array](/solution/1500-1599/1538.Guess%20the%20Majority%20in%20a%20Hidden%20Array/README.md)
-  - [1539.Kth Missing Positive Number](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README.md)
-  - [1540.Can Convert String in K Moves](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README.md)
-  - [1541.Minimum Insertions to Balance a Parentheses String](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md)
-  - [1542.Find Longest Awesome Substring](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README.md)
-  - [1543.Fix Product Name Format](/solution/1500-1599/1543.Fix%20Product%20Name%20Format/README.md)
-  - [1544.Make The String Great](/solution/1500-1599/1544.Make%20The%20String%20Great/README.md)
-  - [1545.Find Kth Bit in Nth Binary String](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README.md)
-  - [1546.Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README.md)
-  - [1547.Minimum Cost to Cut a Stick](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README.md)
-  - [1548.The Most Similar Path in a Graph](/solution/1500-1599/1548.The%20Most%20Similar%20Path%20in%20a%20Graph/README.md)
-  - [1549.The Most Recent Orders for Each Product](/solution/1500-1599/1549.The%20Most%20Recent%20Orders%20for%20Each%20Product/README.md)
-  - [1550.Three Consecutive Odds](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README.md)
-  - [1551.Minimum Operations to Make Array Equal](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README.md)
-  - [1552.Magnetic Force Between Two Balls](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README.md)
-  - [1553.Minimum Number of Days to Eat N Oranges](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README.md)
-  - [1554.Strings Differ by One Character](/solution/1500-1599/1554.Strings%20Differ%20by%20One%20Character/README.md)
-  - [1555.Bank Account Summary](/solution/1500-1599/1555.Bank%20Account%20Summary/README.md)
-  - [1556.Thousand Separator](/solution/1500-1599/1556.Thousand%20Separator/README.md)
-  - [1557.Minimum Number of Vertices to Reach All Nodes](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README.md)
-  - [1558.Minimum Numbers of Function Calls to Make Target Array](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README.md)
-  - [1559.Detect Cycles in 2D Grid](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README.md)
-  - [1560.Most Visited Sector in  a Circular Track](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README.md)
-  - [1561.Maximum Number of Coins You Can Get](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README.md)
-  - [1562.Find Latest Group of Size M](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README.md)
-  - [1563.Stone Game V](/solution/1500-1599/1563.Stone%20Game%20V/README.md)
-  - [1564.Put Boxes Into the Warehouse I](/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README.md)
-  - [1565.Unique Orders and Customers Per Month](/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README.md)
-  - [1566.Detect Pattern of Length M Repeated K or More Times](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README.md)
-  - [1567.Maximum Length of Subarray With Positive Product](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README.md)
-  - [1568.Minimum Number of Days to Disconnect Island](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README.md)
-  - [1569.Number of Ways to Reorder Array to Get Same BST](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README.md)
-  - [1570.Dot Product of Two Sparse Vectors](/solution/1500-1599/1570.Dot%20Product%20of%20Two%20Sparse%20Vectors/README.md)
-  - [1571.Warehouse Manager](/solution/1500-1599/1571.Warehouse%20Manager/README.md)
-  - [1572.Matrix Diagonal Sum](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README.md)
-  - [1573.Number of Ways to Split a String](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md)
-  - [1574.Shortest Subarray to be Removed to Make Array Sorted](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md)
-  - [1575.Count All Possible Routes](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md)
-  - [1576.Replace All 's to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md)
-  - [1577.Number of Ways Where Square of Number Is Equal to Product of Two Numbers](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md)
-  - [1578.Minimum Time to Make Rope Colorful](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README.md)
-  - [1579.Remove Max Number of Edges to Keep Graph Fully Traversable](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md)
-  - [1580.Put Boxes Into the Warehouse II](/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README.md)
-  - [1581.Customer Who Visited but Did Not Make Any Transactions](/solution/1500-1599/1581.Customer%20Who%20Visited%20but%20Did%20Not%20Make%20Any%20Transactions/README.md)
-  - [1582.Special Positions in a Binary Matrix](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README.md)
-  - [1583.Count Unhappy Friends](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README.md)
-  - [1584.Min Cost to Connect All Points](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README.md)
-  - [1585.Check If String Is Transformable With Substring Sort Operations](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README.md)
-  - [1586.Binary Search Tree Iterator II](/solution/1500-1599/1586.Binary%20Search%20Tree%20Iterator%20II/README.md)
-  - [1587.Bank Account Summary II](/solution/1500-1599/1587.Bank%20Account%20Summary%20II/README.md)
-  - [1588.Sum of All Odd Length Subarrays](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README.md)
-  - [1589.Maximum Sum Obtained of Any Permutation](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README.md)
-  - [1590.Make Sum Divisible by P](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README.md)
-  - [1591.Strange Printer II](/solution/1500-1599/1591.Strange%20Printer%20II/README.md)
-  - [1592.Rearrange Spaces Between Words](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README.md)
-  - [1593.Split a String Into the Max Number of Unique Substrings](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README.md)
-  - [1594.Maximum Non Negative Product in a Matrix](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README.md)
-  - [1595.Minimum Cost to Connect Two Groups of Points](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README.md)
-  - [1596.The Most Frequently Ordered Products for Each Customer](/solution/1500-1599/1596.The%20Most%20Frequently%20Ordered%20Products%20for%20Each%20Customer/README.md)
-  - [1597.Build Binary Expression Tree From Infix Expression](/solution/1500-1599/1597.Build%20Binary%20Expression%20Tree%20From%20Infix%20Expression/README.md)
-  - [1598.Crawler Log Folder](/solution/1500-1599/1598.Crawler%20Log%20Folder/README.md)
-  - [1599.Maximum Profit of Operating a Centennial Wheel](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README.md)
+  - [1500.设计文件分享系统](/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README.md)
+  - [1501.可以放心投资的国家](/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README.md)
+  - [1502.判断能否形成等差数列](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README.md)
+  - [1503.所有蚂蚁掉下来前的最后一刻](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README.md)
+  - [1504.统计全 1 子矩形](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README.md)
+  - [1505.最多 K 次交换相邻数位后得到的最小整数](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README.md)
+  - [1506.找到 N 叉树的根节点](/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/README.md)
+  - [1507.转变日期格式](/solution/1500-1599/1507.Reformat%20Date/README.md)
+  - [1508.子数组和排序后的区间和](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README.md)
+  - [1509.三次操作后最大值与最小值的最小差](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README.md)
+  - [1510.石子游戏 IV](/solution/1500-1599/1510.Stone%20Game%20IV/README.md)
+  - [1511.消费者下单频率](/solution/1500-1599/1511.Customer%20Order%20Frequency/README.md)
+  - [1512.好数对的数目](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README.md)
+  - [1513.仅含 1 的子串数](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md)
+  - [1514.概率最大的路径](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README.md)
+  - [1515.服务中心的最佳位置](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README.md)
+  - [1516.移动 N 叉树的子树](/solution/1500-1599/1516.Move%20Sub-Tree%20of%20N-Ary%20Tree/README.md)
+  - [1517.查找拥有有效邮箱的用户](/solution/1500-1599/1517.Find%20Users%20With%20Valid%20E-Mails/README.md)
+  - [1518.换酒问题](/solution/1500-1599/1518.Water%20Bottles/README.md)
+  - [1519.子树中标签相同的节点数](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README.md)
+  - [1520.最多的不重叠子字符串](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README.md)
+  - [1521.找到最接近目标值的函数值](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README.md)
+  - [1522.N 叉树的直径](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md)
+  - [1523.在区间范围内统计奇数数目](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README.md)
+  - [1524.和为奇数的子数组数目](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README.md)
+  - [1525.字符串的好分割数目](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README.md)
+  - [1526.形成目标数组的子数组最少增加次数](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README.md)
+  - [1527.患某种疾病的患者](/solution/1500-1599/1527.Patients%20With%20a%20Condition/README.md)
+  - [1528.重新排列字符串](/solution/1500-1599/1528.Shuffle%20String/README.md)
+  - [1529.最少的后缀翻转次数](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README.md)
+  - [1530.好叶子节点对的数量](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README.md)
+  - [1531.压缩字符串 II](/solution/1500-1599/1531.String%20Compression%20II/README.md)
+  - [1532.最近的三笔订单](/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README.md)
+  - [1533.找到最大整数的索引](/solution/1500-1599/1533.Find%20the%20Index%20of%20the%20Large%20Integer/README.md)
+  - [1534.统计好三元组](/solution/1500-1599/1534.Count%20Good%20Triplets/README.md)
+  - [1535.找出数组游戏的赢家](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README.md)
+  - [1536.排布二进制网格的最少交换次数](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README.md)
+  - [1537.最大得分](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README.md)
+  - [1538.找出隐藏数组中出现次数最多的元素](/solution/1500-1599/1538.Guess%20the%20Majority%20in%20a%20Hidden%20Array/README.md)
+  - [1539.第 k 个缺失的正整数](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README.md)
+  - [1540.K 次操作转变字符串](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README.md)
+  - [1541.平衡括号字符串的最少插入次数](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md)
+  - [1542.找出最长的超赞子字符串](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README.md)
+  - [1543.产品名称格式修复](/solution/1500-1599/1543.Fix%20Product%20Name%20Format/README.md)
+  - [1544.整理字符串](/solution/1500-1599/1544.Make%20The%20String%20Great/README.md)
+  - [1545.找出第 N 个二进制字符串中的第 K 位](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README.md)
+  - [1546.和为目标值且不重叠的非空子数组的最大数目](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README.md)
+  - [1547.切棍子的最小成本](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README.md)
+  - [1548.图中最相似的路径](/solution/1500-1599/1548.The%20Most%20Similar%20Path%20in%20a%20Graph/README.md)
+  - [1549.每件商品的最新订单](/solution/1500-1599/1549.The%20Most%20Recent%20Orders%20for%20Each%20Product/README.md)
+  - [1550.存在连续三个奇数的数组](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README.md)
+  - [1551.使数组中所有元素相等的最小操作数](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README.md)
+  - [1552.两球之间的磁力](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README.md)
+  - [1553.吃掉 N 个橘子的最少天数](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README.md)
+  - [1554.只有一个不同字符的字符串](/solution/1500-1599/1554.Strings%20Differ%20by%20One%20Character/README.md)
+  - [1555.银行账户概要](/solution/1500-1599/1555.Bank%20Account%20Summary/README.md)
+  - [1556.千位分隔数](/solution/1500-1599/1556.Thousand%20Separator/README.md)
+  - [1557.可以到达所有点的最少点数目](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README.md)
+  - [1558.得到目标数组的最少函数调用次数](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README.md)
+  - [1559.二维网格图中探测环](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README.md)
+  - [1560.圆形赛道上经过次数最多的扇区](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README.md)
+  - [1561.你可以获得的最大硬币数目](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README.md)
+  - [1562.查找大小为 M 的最新分组](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README.md)
+  - [1563.石子游戏 V](/solution/1500-1599/1563.Stone%20Game%20V/README.md)
+  - [1564.把箱子放进仓库里 I](/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README.md)
+  - [1565.按月统计订单数与顾客数](/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README.md)
+  - [1566.重复至少 K 次且长度为 M 的模式](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README.md)
+  - [1567.乘积为正数的最长子数组长度](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README.md)
+  - [1568.使陆地分离的最少天数](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README.md)
+  - [1569.将子数组重新排序得到同一个二叉查找树的方案数](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README.md)
+  - [1570.两个稀疏向量的点积](/solution/1500-1599/1570.Dot%20Product%20of%20Two%20Sparse%20Vectors/README.md)
+  - [1571.仓库经理](/solution/1500-1599/1571.Warehouse%20Manager/README.md)
+  - [1572.矩阵对角线元素的和](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README.md)
+  - [1573.分割字符串的方案数](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md)
+  - [1574.删除最短的子数组使剩余数组有序](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md)
+  - [1575.统计所有可行路径](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md)
+  - [1576.替换所有的问号](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md)
+  - [1577.数的平方等于两数乘积的方法数](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md)
+  - [1578.使绳子变成彩色的最短时间](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README.md)
+  - [1579.保证图可完全遍历](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md)
+  - [1580.把箱子放进仓库里 II](/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README.md)
+  - [1581.进店却未进行过交易的顾客](/solution/1500-1599/1581.Customer%20Who%20Visited%20but%20Did%20Not%20Make%20Any%20Transactions/README.md)
+  - [1582.二进制矩阵中的特殊位置](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README.md)
+  - [1583.统计不开心的朋友](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README.md)
+  - [1584.连接所有点的最小费用](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README.md)
+  - [1585.检查字符串是否可以通过排序子字符串得到另一个字符串](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README.md)
+  - [1586.二叉搜索树迭代器 II](/solution/1500-1599/1586.Binary%20Search%20Tree%20Iterator%20II/README.md)
+  - [1587.银行账户概要 II](/solution/1500-1599/1587.Bank%20Account%20Summary%20II/README.md)
+  - [1588.所有奇数长度子数组的和](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README.md)
+  - [1589.所有排列中的最大和](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README.md)
+  - [1590.使数组和能被 P 整除](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README.md)
+  - [1591.奇怪的打印机 II](/solution/1500-1599/1591.Strange%20Printer%20II/README.md)
+  - [1592.重新排列单词间的空格](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README.md)
+  - [1593.拆分字符串使唯一子字符串的数目最大](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README.md)
+  - [1594.矩阵的最大非负积](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README.md)
+  - [1595.连通两组点的最小成本](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README.md)
+  - [1596.每位顾客最经常订购的商品](/solution/1500-1599/1596.The%20Most%20Frequently%20Ordered%20Products%20for%20Each%20Customer/README.md)
+  - [1597.根据中缀表达式构造二叉表达式树](/solution/1500-1599/1597.Build%20Binary%20Expression%20Tree%20From%20Infix%20Expression/README.md)
+  - [1598.文件夹操作日志搜集器](/solution/1500-1599/1598.Crawler%20Log%20Folder/README.md)
+  - [1599.经营摩天轮的最大利润](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README.md)
 
 - 1600-1699
-  - [1600.Throne Inheritance](/solution/1600-1699/1600.Throne%20Inheritance/README.md)
-  - [1601.Maximum Number of Achievable Transfer Requests](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README.md)
-  - [1602.Find Nearest Right Node in Binary Tree](/solution/1600-1699/1602.Find%20Nearest%20Right%20Node%20in%20Binary%20Tree/README.md)
-  - [1603.Design Parking System](/solution/1600-1699/1603.Design%20Parking%20System/README.md)
-  - [1604.Alert Using Same Key-Card Three or More Times in a One Hour Period](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README.md)
-  - [1605.Find Valid Matrix Given Row and Column Sums](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README.md)
-  - [1606.Find Servers That Handled Most Number of Requests](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README.md)
-  - [1607.Sellers With No Sales](/solution/1600-1699/1607.Sellers%20With%20No%20Sales/README.md)
-  - [1608.Special Array With X Elements Greater Than or Equal X](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README.md)
-  - [1609.Even Odd Tree](/solution/1600-1699/1609.Even%20Odd%20Tree/README.md)
-  - [1610.Maximum Number of Visible Points](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README.md)
-  - [1611.Minimum One Bit Operations to Make Integers Zero](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README.md)
-  - [1612.Check If Two Expression Trees are Equivalent](/solution/1600-1699/1612.Check%20If%20Two%20Expression%20Trees%20are%20Equivalent/README.md)
-  - [1613.Find the Missing IDs](/solution/1600-1699/1613.Find%20the%20Missing%20IDs/README.md)
-  - [1614.Maximum Nesting Depth of the Parentheses](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README.md)
-  - [1615.Maximal Network Rank](/solution/1600-1699/1615.Maximal%20Network%20Rank/README.md)
-  - [1616.Split Two Strings to Make Palindrome](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README.md)
-  - [1617.Count Subtrees With Max Distance Between Cities](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README.md)
-  - [1618.Maximum Font to Fit a Sentence in a Screen](/solution/1600-1699/1618.Maximum%20Font%20to%20Fit%20a%20Sentence%20in%20a%20Screen/README.md)
-  - [1619.Mean of Array After Removing Some Elements](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README.md)
-  - [1620.Coordinate With Maximum Network Quality](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README.md)
-  - [1621.Number of Sets of K Non-Overlapping Line Segments](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README.md)
-  - [1622.Fancy Sequence](/solution/1600-1699/1622.Fancy%20Sequence/README.md)
-  - [1623.All Valid Triplets That Can Represent a Country](/solution/1600-1699/1623.All%20Valid%20Triplets%20That%20Can%20Represent%20a%20Country/README.md)
-  - [1624.Largest Substring Between Two Equal Characters](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README.md)
-  - [1625.Lexicographically Smallest String After Applying Operations](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README.md)
-  - [1626.Best Team With No Conflicts](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README.md)
-  - [1627.Graph Connectivity With Threshold](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README.md)
-  - [1628.Design an Expression Tree With Evaluate Function](/solution/1600-1699/1628.Design%20an%20Expression%20Tree%20With%20Evaluate%20Function/README.md)
-  - [1629.Slowest Key](/solution/1600-1699/1629.Slowest%20Key/README.md)
-  - [1630.Arithmetic Subarrays](/solution/1600-1699/1630.Arithmetic%20Subarrays/README.md)
-  - [1631.Path With Minimum Effort](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README.md)
-  - [1632.Rank Transform of a Matrix](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README.md)
-  - [1633.Percentage of Users Attended a Contest](/solution/1600-1699/1633.Percentage%20of%20Users%20Attended%20a%20Contest/README.md)
-  - [1634.Add Two Polynomials Represented as Linked Lists](/solution/1600-1699/1634.Add%20Two%20Polynomials%20Represented%20as%20Linked%20Lists/README.md)
-  - [1635.Hopper Company Queries I](/solution/1600-1699/1635.Hopper%20Company%20Queries%20I/README.md)
-  - [1636.Sort Array by Increasing Frequency](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README.md)
-  - [1637.Widest Vertical Area Between Two Points Containing No Points](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README.md)
-  - [1638.Count Substrings That Differ by One Character](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README.md)
-  - [1639.Number of Ways to Form a Target String Given a Dictionary](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README.md)
-  - [1640.Check Array Formation Through Concatenation](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README.md)
-  - [1641.Count Sorted Vowel Strings](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README.md)
-  - [1642.Furthest Building You Can Reach](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README.md)
-  - [1643.Kth Smallest Instructions](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README.md)
-  - [1644.Lowest Common Ancestor of a Binary Tree II](/solution/1600-1699/1644.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20II/README.md)
+  - [1600.王位继承顺序](/solution/1600-1699/1600.Throne%20Inheritance/README.md)
+  - [1601.最多可达成的换楼请求数目](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README.md)
+  - [1602.找到二叉树中最近的右侧节点](/solution/1600-1699/1602.Find%20Nearest%20Right%20Node%20in%20Binary%20Tree/README.md)
+  - [1603.设计停车系统](/solution/1600-1699/1603.Design%20Parking%20System/README.md)
+  - [1604.警告一小时内使用相同员工卡大于等于三次的人](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README.md)
+  - [1605.给定行和列的和求可行矩阵](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README.md)
+  - [1606.找到处理最多请求的服务器](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README.md)
+  - [1607.没有卖出的卖家](/solution/1600-1699/1607.Sellers%20With%20No%20Sales/README.md)
+  - [1608.特殊数组的特征值](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README.md)
+  - [1609.奇偶树](/solution/1600-1699/1609.Even%20Odd%20Tree/README.md)
+  - [1610.可见点的最大数目](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README.md)
+  - [1611.使整数变为 0 的最少操作次数](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README.md)
+  - [1612.检查两棵二叉表达式树是否等价](/solution/1600-1699/1612.Check%20If%20Two%20Expression%20Trees%20are%20Equivalent/README.md)
+  - [1613.找到遗失的ID](/solution/1600-1699/1613.Find%20the%20Missing%20IDs/README.md)
+  - [1614.括号的最大嵌套深度](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README.md)
+  - [1615.最大网络秩](/solution/1600-1699/1615.Maximal%20Network%20Rank/README.md)
+  - [1616.分割两个字符串得到回文串](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README.md)
+  - [1617.统计子树中城市之间最大距离](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README.md)
+  - [1618.找出适应屏幕的最大字号](/solution/1600-1699/1618.Maximum%20Font%20to%20Fit%20a%20Sentence%20in%20a%20Screen/README.md)
+  - [1619.删除某些元素后的数组均值](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README.md)
+  - [1620.网络信号最好的坐标](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README.md)
+  - [1621.大小为 K 的不重叠线段的数目](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README.md)
+  - [1622.奇妙序列](/solution/1600-1699/1622.Fancy%20Sequence/README.md)
+  - [1623.三人国家代表队](/solution/1600-1699/1623.All%20Valid%20Triplets%20That%20Can%20Represent%20a%20Country/README.md)
+  - [1624.两个相同字符之间的最长子字符串](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README.md)
+  - [1625.执行操作后字典序最小的字符串](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README.md)
+  - [1626.无矛盾的最佳球队](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README.md)
+  - [1627.带阈值的图连通性](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README.md)
+  - [1628.设计带解析函数的表达式树](/solution/1600-1699/1628.Design%20an%20Expression%20Tree%20With%20Evaluate%20Function/README.md)
+  - [1629.按键持续时间最长的键](/solution/1600-1699/1629.Slowest%20Key/README.md)
+  - [1630.等差子数组](/solution/1600-1699/1630.Arithmetic%20Subarrays/README.md)
+  - [1631.最小体力消耗路径](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README.md)
+  - [1632.矩阵转换后的秩](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README.md)
+  - [1633.各赛事的用户注册率](/solution/1600-1699/1633.Percentage%20of%20Users%20Attended%20a%20Contest/README.md)
+  - [1634.求两个多项式链表的和](/solution/1600-1699/1634.Add%20Two%20Polynomials%20Represented%20as%20Linked%20Lists/README.md)
+  - [1635.Hopper 公司查询 I](/solution/1600-1699/1635.Hopper%20Company%20Queries%20I/README.md)
+  - [1636.按照频率将数组升序排序](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README.md)
+  - [1637.两点之间不包含任何点的最宽垂直面积](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README.md)
+  - [1638.统计只差一个字符的子串数目](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README.md)
+  - [1639.通过给定词典构造目标字符串的方案数](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README.md)
+  - [1640.能否连接形成数组](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README.md)
+  - [1641.统计字典序元音字符串的数目](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README.md)
+  - [1642.可以到达的最远建筑](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README.md)
+  - [1643.第 K 条最小指令](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README.md)
+  - [1644.二叉树的最近公共祖先 II](/solution/1600-1699/1644.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20II/README.md)
   - [1645.Hopper Company Queries II](/solution/1600-1699/1645.Hopper%20Company%20Queries%20II/README.md)
-  - [1646.Get Maximum in Generated Array](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README.md)
-  - [1647.Minimum Deletions to Make Character Frequencies Unique](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README.md)
-  - [1648.Sell Diminishing-Valued Colored Balls](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README.md)
-  - [1649.Create Sorted Array through Instructions](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md)
-  - [1650.Lowest Common Ancestor of a Binary Tree III](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README.md)
-  - [1651.Hopper Company Queries III](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README.md)
-  - [1652.Defuse the Bomb](/solution/1600-1699/1652.Defuse%20the%20Bomb/README.md)
-  - [1653.Minimum Deletions to Make String Balanced](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README.md)
-  - [1654.Minimum Jumps to Reach Home](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README.md)
-  - [1655.Distribute Repeating Integers](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README.md)
-  - [1656.Design an Ordered Stream](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README.md)
-  - [1657.Determine if Two Strings Are Close](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README.md)
-  - [1658.Minimum Operations to Reduce X to Zero](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README.md)
-  - [1659.Maximize Grid Happiness](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README.md)
-  - [1660.Correct a Binary Tree](/solution/1600-1699/1660.Correct%20a%20Binary%20Tree/README.md)
-  - [1661.Average Time of Process per Machine](/solution/1600-1699/1661.Average%20Time%20of%20Process%20per%20Machine/README.md)
-  - [1662.Check If Two String Arrays are Equivalent](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README.md)
-  - [1663.Smallest String With A Given Numeric Value](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README.md)
-  - [1664.Ways to Make a Fair Array](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README.md)
-  - [1665.Minimum Initial Energy to Finish Tasks](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README.md)
-  - [1666.Change the Root of a Binary Tree](/solution/1600-1699/1666.Change%20the%20Root%20of%20a%20Binary%20Tree/README.md)
-  - [1667.Fix Names in a Table](/solution/1600-1699/1667.Fix%20Names%20in%20a%20Table/README.md)
-  - [1668.Maximum Repeating Substring](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README.md)
-  - [1669.Merge In Between Linked Lists](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README.md)
-  - [1670.Design Front Middle Back Queue](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README.md)
-  - [1671.Minimum Number of Removals to Make Mountain Array](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README.md)
-  - [1672.Richest Customer Wealth](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README.md)
-  - [1673.Find the Most Competitive Subsequence](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README.md)
-  - [1674.Minimum Moves to Make Array Complementary](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README.md)
-  - [1675.Minimize Deviation in Array](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README.md)
-  - [1676.Lowest Common Ancestor of a Binary Tree IV](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README.md)
-  - [1677.Product's Worth Over Invoices](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README.md)
-  - [1678.Goal Parser Interpretation](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README.md)
-  - [1679.Max Number of K-Sum Pairs](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README.md)
-  - [1680.Concatenation of Consecutive Binary Numbers](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README.md)
-  - [1681.Minimum Incompatibility](/solution/1600-1699/1681.Minimum%20Incompatibility/README.md)
-  - [1682.Longest Palindromic Subsequence II](/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README.md)
-  - [1683.Invalid Tweets](/solution/1600-1699/1683.Invalid%20Tweets/README.md)
-  - [1684.Count the Number of Consistent Strings](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README.md)
-  - [1685.Sum of Absolute Differences in a Sorted Array](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README.md)
-  - [1686.Stone Game VI](/solution/1600-1699/1686.Stone%20Game%20VI/README.md)
-  - [1687.Delivering Boxes from Storage to Ports](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README.md)
-  - [1688.Count of Matches in Tournament](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README.md)
-  - [1689.Partitioning Into Minimum Number Of Deci-Binary Numbers](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README.md)
-  - [1690.Stone Game VII](/solution/1600-1699/1690.Stone%20Game%20VII/README.md)
-  - [1691.Maximum Height by Stacking Cuboids](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md)
-  - [1692.Count Ways to Distribute Candies](/solution/1600-1699/1692.Count%20Ways%20to%20Distribute%20Candies/README.md)
-  - [1693.Daily Leads and Partners](/solution/1600-1699/1693.Daily%20Leads%20and%20Partners/README.md)
-  - [1694.Reformat Phone Number](/solution/1600-1699/1694.Reformat%20Phone%20Number/README.md)
-  - [1695.Maximum Erasure Value](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md)
-  - [1696.Jump Game VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md)
-  - [1697.Checking Existence of Edge Length Limited Paths](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md)
+  - [1646.获取生成数组中的最大值](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README.md)
+  - [1647.字符频次唯一的最小删除次数](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README.md)
+  - [1648.销售价值减少的颜色球](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README.md)
+  - [1649.通过指令创建有序数组](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md)
+  - [1650.二叉树的最近公共祖先 III](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README.md)
+  - [1651.Hopper 公司查询 III](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README.md)
+  - [1652.拆炸弹](/solution/1600-1699/1652.Defuse%20the%20Bomb/README.md)
+  - [1653.使字符串平衡的最少删除次数](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README.md)
+  - [1654.到家的最少跳跃次数](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README.md)
+  - [1655.分配重复整数](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README.md)
+  - [1656.设计有序流](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README.md)
+  - [1657.确定两个字符串是否接近](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README.md)
+  - [1658.将 x 减到 0 的最小操作数](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README.md)
+  - [1659.最大化网格幸福感](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README.md)
+  - [1660.纠正二叉树](/solution/1600-1699/1660.Correct%20a%20Binary%20Tree/README.md)
+  - [1661.每台机器的进程平均运行时间](/solution/1600-1699/1661.Average%20Time%20of%20Process%20per%20Machine/README.md)
+  - [1662.检查两个字符串数组是否相等](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README.md)
+  - [1663.具有给定数值的最小字符串](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README.md)
+  - [1664.生成平衡数组的方案数](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README.md)
+  - [1665.完成所有任务的最少初始能量](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README.md)
+  - [1666.改变二叉树的根节点](/solution/1600-1699/1666.Change%20the%20Root%20of%20a%20Binary%20Tree/README.md)
+  - [1667.修复表中的名字](/solution/1600-1699/1667.Fix%20Names%20in%20a%20Table/README.md)
+  - [1668.最大重复子字符串](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README.md)
+  - [1669.合并两个链表](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README.md)
+  - [1670.设计前中后队列](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README.md)
+  - [1671.得到山形数组的最少删除次数](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README.md)
+  - [1672.最富有客户的资产总量](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README.md)
+  - [1673.找出最具竞争力的子序列](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README.md)
+  - [1674.使数组互补的最少操作次数](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README.md)
+  - [1675.数组的最小偏移量](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README.md)
+  - [1676.二叉树的最近公共祖先 IV](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README.md)
+  - [1677.发票中的产品金额](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README.md)
+  - [1678.设计 Goal 解析器](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README.md)
+  - [1679.K 和数对的最大数目](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README.md)
+  - [1680.连接连续二进制数字](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README.md)
+  - [1681.最小不兼容性](/solution/1600-1699/1681.Minimum%20Incompatibility/README.md)
+  - [1682.最长回文子序列 II](/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README.md)
+  - [1683.无效的推文](/solution/1600-1699/1683.Invalid%20Tweets/README.md)
+  - [1684.统计一致字符串的数目](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README.md)
+  - [1685.有序数组中差绝对值之和](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README.md)
+  - [1686.石子游戏 VI](/solution/1600-1699/1686.Stone%20Game%20VI/README.md)
+  - [1687.从仓库到码头运输箱子](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README.md)
+  - [1688.比赛中的配对次数](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README.md)
+  - [1689.十-二进制数的最少数目](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README.md)
+  - [1690.石子游戏 VII](/solution/1600-1699/1690.Stone%20Game%20VII/README.md)
+  - [1691.堆叠长方体的最大高度](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md)
+  - [1692.计算分配糖果的不同方式](/solution/1600-1699/1692.Count%20Ways%20to%20Distribute%20Candies/README.md)
+  - [1693.每天的领导和合伙人](/solution/1600-1699/1693.Daily%20Leads%20and%20Partners/README.md)
+  - [1694.重新格式化电话号码](/solution/1600-1699/1694.Reformat%20Phone%20Number/README.md)
+  - [1695.删除子数组的最大得分](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md)
+  - [1696.跳跃游戏 VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md)
+  - [1697.检查边长度限制的路径是否存在](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md)
   - [1698.Number of Distinct Substrings in a String](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md)
-  - [1699.Number of Calls Between Two Persons](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README.md)
+  - [1699.两人之间的通话次数](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README.md)
 
 - 1700-1799
-  - [1700.Number of Students Unable to Eat Lunch](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md)
-  - [1701.Average Waiting Time](/solution/1700-1799/1701.Average%20Waiting%20Time/README.md)
-  - [1702.Maximum Binary String After Change](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README.md)
-  - [1703.Minimum Adjacent Swaps for K Consecutive Ones](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README.md)
-  - [1704.Determine if String Halves Are Alike](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README.md)
-  - [1705.Maximum Number of Eaten Apples](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README.md)
-  - [1706.Where Will the Ball Fall](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README.md)
-  - [1707.Maximum XOR With an Element From Array](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README.md)
-  - [1708.Largest Subarray Length K](/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README.md)
-  - [1709.Biggest Window Between Visits](/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README.md)
-  - [1710.Maximum Units on a Truck](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README.md)
-  - [1711.Count Good Meals](/solution/1700-1799/1711.Count%20Good%20Meals/README.md)
-  - [1712.Ways to Split Array Into Three Subarrays](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README.md)
-  - [1713.Minimum Operations to Make a Subsequence](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README.md)
-  - [1714.Sum Of Special Evenly-Spaced Elements In Array](/solution/1700-1799/1714.Sum%20Of%20Special%20Evenly-Spaced%20Elements%20In%20Array/README.md)
-  - [1715.Count Apples and Oranges](/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README.md)
-  - [1716.Calculate Money in Leetcode Bank](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README.md)
-  - [1717.Maximum Score From Removing Substrings](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README.md)
-  - [1718.Construct the Lexicographically Largest Valid Sequence](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README.md)
-  - [1719.Number Of Ways To Reconstruct A Tree](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README.md)
-  - [1720.Decode XORed Array](/solution/1700-1799/1720.Decode%20XORed%20Array/README.md)
-  - [1721.Swapping Nodes in a Linked List](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README.md)
-  - [1722.Minimize Hamming Distance After Swap Operations](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README.md)
-  - [1723.Find Minimum Time to Finish All Jobs](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README.md)
-  - [1724.Checking Existence of Edge Length Limited Paths II](/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/README.md)
-  - [1725.Number Of Rectangles That Can Form The Largest Square](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README.md)
-  - [1726.Tuple with Same Product](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README.md)
-  - [1727.Largest Submatrix With Rearrangements](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README.md)
-  - [1728.Cat and Mouse II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README.md)
-  - [1729.Find Followers Count](/solution/1700-1799/1729.Find%20Followers%20Count/README.md)
-  - [1730.Shortest Path to Get Food](/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README.md)
-  - [1731.The Number of Employees Which Report to Each Employee](/solution/1700-1799/1731.The%20Number%20of%20Employees%20Which%20Report%20to%20Each%20Employee/README.md)
-  - [1732.Find the Highest Altitude](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md)
-  - [1733.Minimum Number of People to Teach](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md)
-  - [1734.Decode XORed Permutation](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md)
+  - [1700.无法吃午餐的学生数量](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md)
+  - [1701.平均等待时间](/solution/1700-1799/1701.Average%20Waiting%20Time/README.md)
+  - [1702.修改后的最大二进制字符串](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README.md)
+  - [1703.得到连续 K 个 1 的最少相邻交换次数](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README.md)
+  - [1704.判断字符串的两半是否相似](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README.md)
+  - [1705.吃苹果的最大数目](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README.md)
+  - [1706.球会落何处](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README.md)
+  - [1707.与数组中元素的最大异或值](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README.md)
+  - [1708.长度为 K 的最大子数组](/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README.md)
+  - [1709.访问日期之间最大的空档期](/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README.md)
+  - [1710.卡车上的最大单元数](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README.md)
+  - [1711.大餐计数](/solution/1700-1799/1711.Count%20Good%20Meals/README.md)
+  - [1712.将数组分成三个子数组的方案数](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README.md)
+  - [1713.得到子序列的最少操作次数](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README.md)
+  - [1714.数组中特殊等间距元素的和](/solution/1700-1799/1714.Sum%20Of%20Special%20Evenly-Spaced%20Elements%20In%20Array/README.md)
+  - [1715.苹果和橘子的个数](/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README.md)
+  - [1716.计算力扣银行的钱](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README.md)
+  - [1717.删除子字符串的最大得分](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README.md)
+  - [1718.构建字典序最大的可行序列](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README.md)
+  - [1719.重构一棵树的方案数](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README.md)
+  - [1720.解码异或后的数组](/solution/1700-1799/1720.Decode%20XORed%20Array/README.md)
+  - [1721.交换链表中的节点](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README.md)
+  - [1722.执行交换操作后的最小汉明距离](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README.md)
+  - [1723.完成所有工作的最短时间](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README.md)
+  - [1724.检查边长度限制的路径是否存在 II](/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/README.md)
+  - [1725.可以形成最大正方形的矩形数目](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README.md)
+  - [1726.同积元组](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README.md)
+  - [1727.重新排列后的最大子矩阵](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README.md)
+  - [1728.猫和老鼠 II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README.md)
+  - [1729.求关注者的数量](/solution/1700-1799/1729.Find%20Followers%20Count/README.md)
+  - [1730.获取食物的最短路径](/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README.md)
+  - [1731.每位经理的下属员工数量](/solution/1700-1799/1731.The%20Number%20of%20Employees%20Which%20Report%20to%20Each%20Employee/README.md)
+  - [1732.找到最高海拔](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md)
+  - [1733.需要教语言的最少人数](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md)
+  - [1734.解码异或后的排列](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md)
   - [1735.Count Ways to Make Array With Product](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md)
   - [1736.Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md)
-  - [1737.Change Minimum Characters to Satisfy One of Three Conditions](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md)
-  - [1738.Find Kth Largest XOR Coordinate Value](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md)
-  - [1739.Building Boxes](/solution/1700-1799/1739.Building%20Boxes/README.md)
-  - [1740.Find Distance in a Binary Tree](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README.md)
-  - [1741.Find Total Time Spent by Each Employee](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README.md)
+  - [1737.满足三条件之一需改变的最少字符数](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md)
+  - [1738.找出第 K 大的异或坐标值](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md)
+  - [1739.放置盒子](/solution/1700-1799/1739.Building%20Boxes/README.md)
+  - [1740.找到二叉树中的距离](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README.md)
+  - [1741.查找每个员工花费的总时间](/solution/1700-1799/1741.Find%20Total%20Time%20Spent%20by%20Each%20Employee/README.md)
   - [1742.Maximum Number of Balls in a Box](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md)
-  - [1743.Restore the Array From Adjacent Pairs](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md)
-  - [1744.Can You Eat Your Favorite Candy on Your Favorite Day](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md)
-  - [1745.Palindrome Partitioning IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md)
-  - [1746.Maximum Subarray Sum After One Operation](/solution/1700-1799/1746.Maximum%20Subarray%20Sum%20After%20One%20Operation/README.md)
-  - [1747.Leetflex Banned Accounts](/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README.md)
-  - [1748.Sum of Unique Elements](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md)
-  - [1749.Maximum Absolute Sum of Any Subarray](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md)
-  - [1750.Minimum Length of String After Deleting Similar Ends](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md)
+  - [1743.从相邻元素对还原数组](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md)
+  - [1744.你能在你最喜欢的那天吃到你最喜欢的糖果吗？](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md)
+  - [1745.回文串分割 IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md)
+  - [1746.经过一次操作后的最大子数组和](/solution/1700-1799/1746.Maximum%20Subarray%20Sum%20After%20One%20Operation/README.md)
+  - [1747.应该被禁止的Leetflex账户](/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README.md)
+  - [1748.唯一元素的和](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md)
+  - [1749.任意子数组和的绝对值的最大值](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md)
+  - [1750.删除字符串两端相同字符后的最短长度](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md)
   - [1751.Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md)
-  - [1752.Check if Array Is Sorted and Rotated](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md)
-  - [1753.Maximum Score From Removing Stones](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md)
-  - [1754.Largest Merge Of Two Strings](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md)
-  - [1755.Closest Subsequence Sum](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md)
-  - [1756.Design Most Recently Used Queue](/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README.md)
-  - [1757.Recyclable and Low Fat Products](/solution/1700-1799/1757.Recyclable%20and%20Low%20Fat%20Products/README.md)
-  - [1758.Minimum Changes To Make Alternating Binary String](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README.md)
-  - [1759.Count Number of Homogenous Substrings](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README.md)
-  - [1760.Minimum Limit of Balls in a Bag](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README.md)
-  - [1761.Minimum Degree of a Connected Trio in a Graph](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README.md)
-  - [1762.Buildings With an Ocean View](/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README.md)
-  - [1763.Longest Nice Substring](/solution/1700-1799/1763.Longest%20Nice%20Substring/README.md)
-  - [1764.Form Array by Concatenating Subarrays of Another Array](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README.md)
-  - [1765.Map of Highest Peak](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README.md)
-  - [1766.Tree of Coprimes](/solution/1700-1799/1766.Tree%20of%20Coprimes/README.md)
-  - [1767.Find the Subtasks That Did Not Execute](/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README.md)
-  - [1768.Merge Strings Alternately](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README.md)
-  - [1769.Minimum Number of Operations to Move All Balls to Each Box](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README.md)
-  - [1770.Maximum Score from Performing Multiplication Operations](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README.md)
-  - [1771.Maximize Palindrome Length From Subsequences](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README.md)
-  - [1772.Sort Features by Popularity](/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README.md)
-  - [1773.Count Items Matching a Rule](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README.md)
-  - [1774.Closest Dessert Cost](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README.md)
-  - [1775.Equal Sum Arrays With Minimum Number of Operations](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README.md)
-  - [1776.Car Fleet II](/solution/1700-1799/1776.Car%20Fleet%20II/README.md)
-  - [1777.Product's Price for Each Store](/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README.md)
-  - [1778.Shortest Path in a Hidden Grid](/solution/1700-1799/1778.Shortest%20Path%20in%20a%20Hidden%20Grid/README.md)
-  - [1779.Find Nearest Point That Has the Same X or Y Coordinate](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README.md)
-  - [1780.Check if Number is a Sum of Powers of Three](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README.md)
-  - [1781.Sum of Beauty of All Substrings](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README.md)
-  - [1782.Count Pairs Of Nodes](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README.md)
-  - [1783.Grand Slam Titles](/solution/1700-1799/1783.Grand%20Slam%20Titles/README.md)
-  - [1784.Check if Binary String Has at Most One Segment of Ones](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README.md)
-  - [1785.Minimum Elements to Add to Form a Given Sum](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README.md)
-  - [1786.Number of Restricted Paths From First to Last Node](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README.md)
-  - [1787.Make the XOR of All Segments Equal to Zero](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README.md)
-  - [1788.Maximize the Beauty of the Garden](/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README.md)
-  - [1789.Primary Department for Each Employee](/solution/1700-1799/1789.Primary%20Department%20for%20Each%20Employee/README.md)
-  - [1790.Check if One String Swap Can Make Strings Equal](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README.md)
-  - [1791.Find Center of Star Graph](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README.md)
-  - [1792.Maximum Average Pass Ratio](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README.md)
-  - [1793.Maximum Score of a Good Subarray](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README.md)
-  - [1794.Count Pairs of Equal Substrings With Minimum Difference](/solution/1700-1799/1794.Count%20Pairs%20of%20Equal%20Substrings%20With%20Minimum%20Difference/README.md)
-  - [1795.Rearrange Products Table](/solution/1700-1799/1795.Rearrange%20Products%20Table/README.md)
-  - [1796.Second Largest Digit in a String](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README.md)
-  - [1797.Design Authentication Manager](/solution/1700-1799/1797.Design%20Authentication%20Manager/README.md)
-  - [1798.Maximum Number of Consecutive Values You Can Make](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README.md)
-  - [1799.Maximize Score After N Operations](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README.md)
+  - [1752.检查数组是否经排序和轮转得到](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md)
+  - [1753.移除石子的最大得分](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md)
+  - [1754.构造字典序最大的合并字符串](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md)
+  - [1755.最接近目标值的子序列和](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md)
+  - [1756.设计最近使用（MRU）队列](/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README.md)
+  - [1757.可回收且低脂的产品](/solution/1700-1799/1757.Recyclable%20and%20Low%20Fat%20Products/README.md)
+  - [1758.生成交替二进制字符串的最少操作数](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README.md)
+  - [1759.统计同构子字符串的数目](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README.md)
+  - [1760.袋子里最少数目的球](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README.md)
+  - [1761.一个图中连通三元组的最小度数](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README.md)
+  - [1762.能看到海景的建筑物](/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README.md)
+  - [1763.最长的美好子字符串](/solution/1700-1799/1763.Longest%20Nice%20Substring/README.md)
+  - [1764.通过连接另一个数组的子数组得到一个数组](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README.md)
+  - [1765.地图中的最高点](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README.md)
+  - [1766.互质树](/solution/1700-1799/1766.Tree%20of%20Coprimes/README.md)
+  - [1767.寻找没有被执行的任务对](/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README.md)
+  - [1768.交替合并字符串](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README.md)
+  - [1769.移动所有球到每个盒子所需的最小操作数](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README.md)
+  - [1770.执行乘法运算的最大分数](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README.md)
+  - [1771.由子序列构造的最长回文串的长度](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README.md)
+  - [1772.按受欢迎程度排列功能](/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README.md)
+  - [1773.统计匹配检索规则的物品数量](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README.md)
+  - [1774.最接近目标价格的甜点成本](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README.md)
+  - [1775.通过最少操作次数使数组的和相等](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README.md)
+  - [1776.车队 II](/solution/1700-1799/1776.Car%20Fleet%20II/README.md)
+  - [1777.每家商店的产品价格](/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README.md)
+  - [1778.未知网格中的最短路径](/solution/1700-1799/1778.Shortest%20Path%20in%20a%20Hidden%20Grid/README.md)
+  - [1779.找到最近的有相同 X 或 Y 坐标的点](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README.md)
+  - [1780.判断一个数字是否可以表示成三的幂的和](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README.md)
+  - [1781.所有子字符串美丽值之和](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README.md)
+  - [1782.统计点对的数目](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README.md)
+  - [1783.大满贯数量](/solution/1700-1799/1783.Grand%20Slam%20Titles/README.md)
+  - [1784.检查二进制字符串字段](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README.md)
+  - [1785.构成特定和需要添加的最少元素](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README.md)
+  - [1786.从第一个节点出发到最后一个节点的受限路径数](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README.md)
+  - [1787.使所有区间的异或结果为零](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README.md)
+  - [1788.最大化花园的美观度](/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README.md)
+  - [1789.员工的直属部门](/solution/1700-1799/1789.Primary%20Department%20for%20Each%20Employee/README.md)
+  - [1790.仅执行一次字符串交换能否使两个字符串相等](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README.md)
+  - [1791.找出星型图的中心节点](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README.md)
+  - [1792.最大平均通过率](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README.md)
+  - [1793.好子数组的最大分数](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README.md)
+  - [1794.统计距离最小的子串对个数](/solution/1700-1799/1794.Count%20Pairs%20of%20Equal%20Substrings%20With%20Minimum%20Difference/README.md)
+  - [1795.每个产品在不同商店的价格](/solution/1700-1799/1795.Rearrange%20Products%20Table/README.md)
+  - [1796.字符串中第二大的数字](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README.md)
+  - [1797.设计一个验证系统](/solution/1700-1799/1797.Design%20Authentication%20Manager/README.md)
+  - [1798.你能构造出连续值的最大数目](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README.md)
+  - [1799.N 次操作后的最大分数和](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README.md)
 
 - 1800-1899
-  - [1800.Maximum Ascending Subarray Sum](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README.md)
-  - [1801.Number of Orders in the Backlog](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README.md)
-  - [1802.Maximum Value at a Given Index in a Bounded Array](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README.md)
-  - [1803.Count Pairs With XOR in a Range](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README.md)
-  - [1804.Implement Trie II (Prefix Tree)](/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README.md)
-  - [1805.Number of Different Integers in a String](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README.md)
-  - [1806.Minimum Number of Operations to Reinitialize a Permutation](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README.md)
-  - [1807.Evaluate the Bracket Pairs of a String](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README.md)
-  - [1808.Maximize Number of Nice Divisors](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README.md)
-  - [1809.Ad-Free Sessions](/solution/1800-1899/1809.Ad-Free%20Sessions/README.md)
-  - [1810.Minimum Path Cost in a Hidden Grid](/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README.md)
-  - [1811.Find Interview Candidates](/solution/1800-1899/1811.Find%20Interview%20Candidates/README.md)
-  - [1812.Determine Color of a Chessboard Square](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README.md)
-  - [1813.Sentence Similarity III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README.md)
-  - [1814.Count Nice Pairs in an Array](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README.md)
-  - [1815.Maximum Number of Groups Getting Fresh Donuts](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README.md)
-  - [1816.Truncate Sentence](/solution/1800-1899/1816.Truncate%20Sentence/README.md)
-  - [1817.Finding the Users Active Minutes](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README.md)
-  - [1818.Minimum Absolute Sum Difference](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README.md)
-  - [1819.Number of Different Subsequences GCDs](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README.md)
-  - [1820.Maximum Number of Accepted Invitations](/solution/1800-1899/1820.Maximum%20Number%20of%20Accepted%20Invitations/README.md)
-  - [1821.Find Customers With Positive Revenue this Year](/solution/1800-1899/1821.Find%20Customers%20With%20Positive%20Revenue%20this%20Year/README.md)
-  - [1822.Sign of the Product of an Array](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README.md)
-  - [1823.Find the Winner of the Circular Game](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README.md)
-  - [1824.Minimum Sideway Jumps](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README.md)
-  - [1825.Finding MK Average](/solution/1800-1899/1825.Finding%20MK%20Average/README.md)
-  - [1826.Faulty Sensor](/solution/1800-1899/1826.Faulty%20Sensor/README.md)
-  - [1827.Minimum Operations to Make the Array Increasing](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README.md)
-  - [1828.Queries on Number of Points Inside a Circle](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README.md)
-  - [1829.Maximum XOR for Each Query](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README.md)
-  - [1830.Minimum Number of Operations to Make String Sorted](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README.md)
-  - [1831.Maximum Transaction Each Day](/solution/1800-1899/1831.Maximum%20Transaction%20Each%20Day/README.md)
-  - [1832.Check if the Sentence Is Pangram](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README.md)
-  - [1833.Maximum Ice Cream Bars](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README.md)
-  - [1834.Single-Threaded CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README.md)
-  - [1835.Find XOR Sum of All Pairs Bitwise AND](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README.md)
-  - [1836.Remove Duplicates From an Unsorted Linked List](/solution/1800-1899/1836.Remove%20Duplicates%20From%20an%20Unsorted%20Linked%20List/README.md)
-  - [1837.Sum of Digits in Base K](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README.md)
-  - [1838.Frequency of the Most Frequent Element](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README.md)
-  - [1839.Longest Substring Of All Vowels in Order](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README.md)
-  - [1840.Maximum Building Height](/solution/1800-1899/1840.Maximum%20Building%20Height/README.md)
-  - [1841.League Statistics](/solution/1800-1899/1841.League%20Statistics/README.md)
-  - [1842.Next Palindrome Using Same Digits](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README.md)
-  - [1843.Suspicious Bank Accounts](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README.md)
-  - [1844.Replace All Digits with Characters](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README.md)
-  - [1845.Seat Reservation Manager](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README.md)
-  - [1846.Maximum Element After Decreasing and Rearranging](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README.md)
-  - [1847.Closest Room](/solution/1800-1899/1847.Closest%20Room/README.md)
-  - [1848.Minimum Distance to the Target Element](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README.md)
-  - [1849.Splitting a String Into Descending Consecutive Values](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README.md)
-  - [1850.Minimum Adjacent Swaps to Reach the Kth Smallest Number](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README.md)
-  - [1851.Minimum Interval to Include Each Query](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README.md)
-  - [1852.Distinct Numbers in Each Subarray](/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README.md)
-  - [1853.Convert Date Format](/solution/1800-1899/1853.Convert%20Date%20Format/README.md)
-  - [1854.Maximum Population Year](/solution/1800-1899/1854.Maximum%20Population%20Year/README.md)
-  - [1855.Maximum Distance Between a Pair of Values](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README.md)
-  - [1856.Maximum Subarray Min-Product](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README.md)
-  - [1857.Largest Color Value in a Directed Graph](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README.md)
-  - [1858.Longest Word With All Prefixes](/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README.md)
-  - [1859.Sorting the Sentence](/solution/1800-1899/1859.Sorting%20the%20Sentence/README.md)
-  - [1860.Incremental Memory Leak](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README.md)
-  - [1861.Rotating the Box](/solution/1800-1899/1861.Rotating%20the%20Box/README.md)
-  - [1862.Sum of Floored Pairs](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README.md)
-  - [1863.Sum of All Subset XOR Totals](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README.md)
-  - [1864.Minimum Number of Swaps to Make the Binary String Alternating](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README.md)
-  - [1865.Finding Pairs With a Certain Sum](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README.md)
-  - [1866.Number of Ways to Rearrange Sticks With K Sticks Visible](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README.md)
-  - [1867.Orders With Maximum Quantity Above Average](/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README.md)
-  - [1868.Product of Two Run-Length Encoded Arrays](/solution/1800-1899/1868.Product%20of%20Two%20Run-Length%20Encoded%20Arrays/README.md)
-  - [1869.Longer Contiguous Segments of Ones than Zeros](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README.md)
-  - [1870.Minimum Speed to Arrive on Time](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README.md)
-  - [1871.Jump Game VII](/solution/1800-1899/1871.Jump%20Game%20VII/README.md)
-  - [1872.Stone Game VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README.md)
-  - [1873.Calculate Special Bonus](/solution/1800-1899/1873.Calculate%20Special%20Bonus/README.md)
-  - [1874.Minimize Product Sum of Two Arrays](/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README.md)
-  - [1875.Group Employees of the Same Salary](/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README.md)
-  - [1876.Substrings of Size Three with Distinct Characters](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README.md)
-  - [1877.Minimize Maximum Pair Sum in Array](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README.md)
-  - [1878.Get Biggest Three Rhombus Sums in a Grid](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README.md)
-  - [1879.Minimum XOR Sum of Two Arrays](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README.md)
-  - [1880.Check if Word Equals Summation of Two Words](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README.md)
-  - [1881.Maximum Value after Insertion](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README.md)
-  - [1882.Process Tasks Using Servers](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README.md)
-  - [1883.Minimum Skips to Arrive at Meeting On Time](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README.md)
-  - [1884.Egg Drop With 2 Eggs and N Floors](/solution/1800-1899/1884.Egg%20Drop%20With%202%20Eggs%20and%20N%20Floors/README.md)
-  - [1885.Count Pairs in Two Arrays](/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README.md)
-  - [1886.Determine Whether Matrix Can Be Obtained By Rotation](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README.md)
-  - [1887.Reduction Operations to Make the Array Elements Equal](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README.md)
-  - [1888.Minimum Number of Flips to Make the Binary String Alternating](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README.md)
-  - [1889.Minimum Space Wasted From Packaging](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README.md)
-  - [1890.The Latest Login in 2020](/solution/1800-1899/1890.The%20Latest%20Login%20in%202020/README.md)
-  - [1891.Cutting Ribbons](/solution/1800-1899/1891.Cutting%20Ribbons/README.md)
-  - [1892.Page Recommendations II](/solution/1800-1899/1892.Page%20Recommendations%20II/README.md)
-  - [1893.Check if All the Integers in a Range Are Covered](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README.md)
-  - [1894.Find the Student that Will Replace the Chalk](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md)
-  - [1895.Largest Magic Square](/solution/1800-1899/1895.Largest%20Magic%20Square/README.md)
-  - [1896.Minimum Cost to Change the Final Value of Expression](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README.md)
-  - [1897.Redistribute Characters to Make All Strings Equal](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README.md)
-  - [1898.Maximum Number of Removable Characters](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md)
-  - [1899.Merge Triplets to Form Target Triplet](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README.md)
+  - [1800.最大升序子数组和](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README.md)
+  - [1801.积压订单中的订单总数](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README.md)
+  - [1802.有界数组中指定下标处的最大值](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README.md)
+  - [1803.统计异或值在范围内的数对有多少](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README.md)
+  - [1804.实现 Trie （前缀树） II](/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README.md)
+  - [1805.字符串中不同整数的数目](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README.md)
+  - [1806.还原排列的最少操作步数](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README.md)
+  - [1807.替换字符串中的括号内容](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README.md)
+  - [1808.好因子的最大数目](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README.md)
+  - [1809.没有广告的剧集](/solution/1800-1899/1809.Ad-Free%20Sessions/README.md)
+  - [1810.隐藏网格下的最小消耗路径](/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README.md)
+  - [1811.寻找面试候选人](/solution/1800-1899/1811.Find%20Interview%20Candidates/README.md)
+  - [1812.判断国际象棋棋盘中一个格子的颜色](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README.md)
+  - [1813.句子相似性 III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README.md)
+  - [1814.统计一个数组中好对子的数目](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README.md)
+  - [1815.得到新鲜甜甜圈的最多组数](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README.md)
+  - [1816.截断句子](/solution/1800-1899/1816.Truncate%20Sentence/README.md)
+  - [1817.查找用户活跃分钟数](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README.md)
+  - [1818.绝对差值和](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README.md)
+  - [1819.序列中不同最大公约数的数目](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README.md)
+  - [1820.最多邀请的个数](/solution/1800-1899/1820.Maximum%20Number%20of%20Accepted%20Invitations/README.md)
+  - [1821.寻找今年具有正收入的客户](/solution/1800-1899/1821.Find%20Customers%20With%20Positive%20Revenue%20this%20Year/README.md)
+  - [1822.数组元素积的符号](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README.md)
+  - [1823.找出游戏的获胜者](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README.md)
+  - [1824.最少侧跳次数](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README.md)
+  - [1825.求出 MK 平均值](/solution/1800-1899/1825.Finding%20MK%20Average/README.md)
+  - [1826.有缺陷的传感器](/solution/1800-1899/1826.Faulty%20Sensor/README.md)
+  - [1827.最少操作使数组递增](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README.md)
+  - [1828.统计一个圆中点的数目](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README.md)
+  - [1829.每个查询的最大异或值](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README.md)
+  - [1830.使字符串有序的最少操作次数](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README.md)
+  - [1831.每天的最大交易](/solution/1800-1899/1831.Maximum%20Transaction%20Each%20Day/README.md)
+  - [1832.判断句子是否为全字母句](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README.md)
+  - [1833.雪糕的最大数量](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README.md)
+  - [1834.单线程 CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README.md)
+  - [1835.所有数对按位与结果的异或和](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README.md)
+  - [1836.从未排序的链表中移除重复元素](/solution/1800-1899/1836.Remove%20Duplicates%20From%20an%20Unsorted%20Linked%20List/README.md)
+  - [1837.K 进制表示下的各位数字总和](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README.md)
+  - [1838.最高频元素的频数](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README.md)
+  - [1839.所有元音按顺序排布的最长子字符串](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README.md)
+  - [1840.最高建筑高度](/solution/1800-1899/1840.Maximum%20Building%20Height/README.md)
+  - [1841.联赛信息统计](/solution/1800-1899/1841.League%20Statistics/README.md)
+  - [1842.下个由相同数字构成的回文串](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README.md)
+  - [1843.可疑银行账户](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README.md)
+  - [1844.将所有数字用字符替换](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README.md)
+  - [1845.座位预约管理系统](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README.md)
+  - [1846.减小和重新排列数组后的最大元素](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README.md)
+  - [1847.最近的房间](/solution/1800-1899/1847.Closest%20Room/README.md)
+  - [1848.到目标元素的最小距离](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README.md)
+  - [1849.将字符串拆分为递减的连续值](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README.md)
+  - [1850.邻位交换的最小次数](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README.md)
+  - [1851.包含每个查询的最小区间](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README.md)
+  - [1852.每个子数组的数字种类数](/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README.md)
+  - [1853.转换日期格式](/solution/1800-1899/1853.Convert%20Date%20Format/README.md)
+  - [1854.人口最多的年份](/solution/1800-1899/1854.Maximum%20Population%20Year/README.md)
+  - [1855.下标对中的最大距离](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README.md)
+  - [1856.子数组最小乘积的最大值](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README.md)
+  - [1857.有向图中最大颜色值](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README.md)
+  - [1858.包含所有前缀的最长单词](/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README.md)
+  - [1859.将句子排序](/solution/1800-1899/1859.Sorting%20the%20Sentence/README.md)
+  - [1860.增长的内存泄露](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README.md)
+  - [1861.旋转盒子](/solution/1800-1899/1861.Rotating%20the%20Box/README.md)
+  - [1862.向下取整数对和](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README.md)
+  - [1863.找出所有子集的异或总和再求和](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README.md)
+  - [1864.构成交替字符串需要的最小交换次数](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README.md)
+  - [1865.找出和为指定值的下标对](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README.md)
+  - [1866.恰有 K 根木棍可以看到的排列数目](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README.md)
+  - [1867.最大数量高于平均水平的订单](/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README.md)
+  - [1868.两个行程编码数组的积](/solution/1800-1899/1868.Product%20of%20Two%20Run-Length%20Encoded%20Arrays/README.md)
+  - [1869.哪种连续子字符串更长](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README.md)
+  - [1870.准时到达的列车最小时速](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README.md)
+  - [1871.跳跃游戏 VII](/solution/1800-1899/1871.Jump%20Game%20VII/README.md)
+  - [1872.石子游戏 VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README.md)
+  - [1873.计算特殊奖金](/solution/1800-1899/1873.Calculate%20Special%20Bonus/README.md)
+  - [1874.两个数组的最小乘积和](/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README.md)
+  - [1875.将工资相同的雇员分组](/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README.md)
+  - [1876.长度为三且各字符不同的子字符串](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README.md)
+  - [1877.数组中最大数对和的最小值](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README.md)
+  - [1878.矩阵中最大的三个菱形和](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README.md)
+  - [1879.两个数组最小的异或值之和](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README.md)
+  - [1880.检查某单词是否等于两单词之和](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README.md)
+  - [1881.插入后的最大值](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README.md)
+  - [1882.使用服务器处理任务](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README.md)
+  - [1883.准时抵达会议现场的最小跳过休息次数](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README.md)
+  - [1884.鸡蛋掉落-两枚鸡蛋](/solution/1800-1899/1884.Egg%20Drop%20With%202%20Eggs%20and%20N%20Floors/README.md)
+  - [1885.统计数对](/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README.md)
+  - [1886.判断矩阵经轮转后是否一致](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README.md)
+  - [1887.使数组元素相等的减少操作次数](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README.md)
+  - [1888.使二进制字符串字符交替的最少反转次数](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README.md)
+  - [1889.装包裹的最小浪费空间](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README.md)
+  - [1890.2020年最后一次登录](/solution/1800-1899/1890.The%20Latest%20Login%20in%202020/README.md)
+  - [1891.割绳子](/solution/1800-1899/1891.Cutting%20Ribbons/README.md)
+  - [1892.页面推荐Ⅱ](/solution/1800-1899/1892.Page%20Recommendations%20II/README.md)
+  - [1893.检查是否区域内所有整数都被覆盖](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README.md)
+  - [1894.找到需要补充粉笔的学生编号](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md)
+  - [1895.最大的幻方](/solution/1800-1899/1895.Largest%20Magic%20Square/README.md)
+  - [1896.反转表达式值的最少操作次数](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README.md)
+  - [1897.重新分配字符使所有字符串都相等](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README.md)
+  - [1898.可移除字符的最大数目](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md)
+  - [1899.合并若干三元组以形成目标三元组](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README.md)
 
 - 1900-1999
-  - [1900.The Earliest and Latest Rounds Where Players Compete](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README.md)
-  - [1901.Find a Peak Element II](/solution/1900-1999/1901.Find%20a%20Peak%20Element%20II/README.md)
-  - [1902.Depth of BST Given Insertion Order](/solution/1900-1999/1902.Depth%20of%20BST%20Given%20Insertion%20Order/README.md)
-  - [1903.Largest Odd Number in String](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README.md)
-  - [1904.The Number of Full Rounds You Have Played](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README.md)
-  - [1905.Count Sub Islands](/solution/1900-1999/1905.Count%20Sub%20Islands/README.md)
-  - [1906.Minimum Absolute Difference Queries](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README.md)
-  - [1907.Count Salary Categories](/solution/1900-1999/1907.Count%20Salary%20Categories/README.md)
-  - [1908.Game of Nim](/solution/1900-1999/1908.Game%20of%20Nim/README.md)
-  - [1909.Remove One Element to Make the Array Strictly Increasing](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README.md)
-  - [1910.Remove All Occurrences of a Substring](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README.md)
-  - [1911.Maximum Alternating Subsequence Sum](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README.md)
-  - [1912.Design Movie Rental System](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README.md)
-  - [1913.Maximum Product Difference Between Two Pairs](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README.md)
-  - [1914.Cyclically Rotating a Grid](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README.md)
-  - [1915.Number of Wonderful Substrings](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README.md)
-  - [1916.Count Ways to Build Rooms in an Ant Colony](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README.md)
-  - [1917.Leetcodify Friends Recommendations](/solution/1900-1999/1917.Leetcodify%20Friends%20Recommendations/README.md)
-  - [1918.Kth Smallest Subarray Sum](/solution/1900-1999/1918.Kth%20Smallest%20Subarray%20Sum/README.md)
-  - [1919.Leetcodify Similar Friends](/solution/1900-1999/1919.Leetcodify%20Similar%20Friends/README.md)
-  - [1920.Build Array from Permutation](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README.md)
-  - [1921.Eliminate Maximum Number of Monsters](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README.md)
-  - [1922.Count Good Numbers](/solution/1900-1999/1922.Count%20Good%20Numbers/README.md)
-  - [1923.Longest Common Subpath](/solution/1900-1999/1923.Longest%20Common%20Subpath/README.md)
-  - [1924.Erect the Fence II](/solution/1900-1999/1924.Erect%20the%20Fence%20II/README.md)
-  - [1925.Count Square Sum Triples](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README.md)
-  - [1926.Nearest Exit from Entrance in Maze](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README.md)
-  - [1927.Sum Game](/solution/1900-1999/1927.Sum%20Game/README.md)
-  - [1928.Minimum Cost to Reach Destination in Time](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README.md)
-  - [1929.Concatenation of Array](/solution/1900-1999/1929.Concatenation%20of%20Array/README.md)
-  - [1930.Unique Length-3 Palindromic Subsequences](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README.md)
-  - [1931.Painting a Grid With Three Different Colors](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README.md)
-  - [1932.Merge BSTs to Create Single BST](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README.md)
-  - [1933.Check if String Is Decomposable Into Value-Equal Substrings](/solution/1900-1999/1933.Check%20if%20String%20Is%20Decomposable%20Into%20Value-Equal%20Substrings/README.md)
-  - [1934.Confirmation Rate](/solution/1900-1999/1934.Confirmation%20Rate/README.md)
-  - [1935.Maximum Number of Words You Can Type](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README.md)
-  - [1936.Add Minimum Number of Rungs](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README.md)
-  - [1937.Maximum Number of Points with Cost](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README.md)
-  - [1938.Maximum Genetic Difference Query](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README.md)
-  - [1939.Users That Actively Request Confirmation Messages](/solution/1900-1999/1939.Users%20That%20Actively%20Request%20Confirmation%20Messages/README.md)
-  - [1940.Longest Common Subsequence Between Sorted Arrays](/solution/1900-1999/1940.Longest%20Common%20Subsequence%20Between%20Sorted%20Arrays/README.md)
-  - [1941.Check if All Characters Have Equal Number of Occurrences](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README.md)
-  - [1942.The Number of the Smallest Unoccupied Chair](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README.md)
-  - [1943.Describe the Painting](/solution/1900-1999/1943.Describe%20the%20Painting/README.md)
-  - [1944.Number of Visible People in a Queue](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README.md)
-  - [1945.Sum of Digits of String After Convert](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README.md)
-  - [1946.Largest Number After Mutating Substring](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README.md)
-  - [1947.Maximum Compatibility Score Sum](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README.md)
-  - [1948.Delete Duplicate Folders in System](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README.md)
-  - [1949.Strong Friendship](/solution/1900-1999/1949.Strong%20Friendship/README.md)
-  - [1950.Maximum of Minimum Values in All Subarrays](/solution/1900-1999/1950.Maximum%20of%20Minimum%20Values%20in%20All%20Subarrays/README.md)
-  - [1951.All the Pairs With the Maximum Number of Common Followers](/solution/1900-1999/1951.All%20the%20Pairs%20With%20the%20Maximum%20Number%20of%20Common%20Followers/README.md)
-  - [1952.Three Divisors](/solution/1900-1999/1952.Three%20Divisors/README.md)
-  - [1953.Maximum Number of Weeks for Which You Can Work](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README.md)
-  - [1954.Minimum Garden Perimeter to Collect Enough Apples](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README.md)
-  - [1955.Count Number of Special Subsequences](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README.md)
-  - [1956.Minimum Time For K Virus Variants to Spread](/solution/1900-1999/1956.Minimum%20Time%20For%20K%20Virus%20Variants%20to%20Spread/README.md)
-  - [1957.Delete Characters to Make Fancy String](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README.md)
-  - [1958.Check if Move is Legal](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README.md)
-  - [1959.Minimum Total Space Wasted With K Resizing Operations](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README.md)
-  - [1960.Maximum Product of the Length of Two Palindromic Substrings](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README.md)
-  - [1961.Check If String Is a Prefix of Array](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README.md)
-  - [1962.Remove Stones to Minimize the Total](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README.md)
-  - [1963.Minimum Number of Swaps to Make the String Balanced](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README.md)
-  - [1964.Find the Longest Valid Obstacle Course at Each Position](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README.md)
-  - [1965.Employees With Missing Information](/solution/1900-1999/1965.Employees%20With%20Missing%20Information/README.md)
-  - [1966.Binary Searchable Numbers in an Unsorted Array](/solution/1900-1999/1966.Binary%20Searchable%20Numbers%20in%20an%20Unsorted%20Array/README.md)
-  - [1967.Number of Strings That Appear as Substrings in Word](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README.md)
-  - [1968.Array With Elements Not Equal to Average of Neighbors](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README.md)
-  - [1969.Minimum Non-Zero Product of the Array Elements](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README.md)
-  - [1970.Last Day Where You Can Still Cross](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README.md)
-  - [1971.Find if Path Exists in Graph](/solution/1900-1999/1971.Find%20if%20Path%20Exists%20in%20Graph/README.md)
-  - [1972.First and Last Call On the Same Day](/solution/1900-1999/1972.First%20and%20Last%20Call%20On%20the%20Same%20Day/README.md)
-  - [1973.Count Nodes Equal to Sum of Descendants](/solution/1900-1999/1973.Count%20Nodes%20Equal%20to%20Sum%20of%20Descendants/README.md)
-  - [1974.Minimum Time to Type Word Using Special Typewriter](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README.md)
-  - [1975.Maximum Matrix Sum](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README.md)
-  - [1976.Number of Ways to Arrive at Destination](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README.md)
-  - [1977.Number of Ways to Separate Numbers](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README.md)
-  - [1978.Employees Whose Manager Left the Company](/solution/1900-1999/1978.Employees%20Whose%20Manager%20Left%20the%20Company/README.md)
-  - [1979.Find Greatest Common Divisor of Array](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README.md)
-  - [1980.Find Unique Binary String](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README.md)
-  - [1981.Minimize the Difference Between Target and Chosen Elements](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README.md)
-  - [1982.Find Array Given Subset Sums](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README.md)
-  - [1983.Widest Pair of Indices With Equal Range Sum](/solution/1900-1999/1983.Widest%20Pair%20of%20Indices%20With%20Equal%20Range%20Sum/README.md)
-  - [1984.Minimum Difference Between Highest and Lowest of K Scores](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README.md)
-  - [1985.Find the Kth Largest Integer in the Array](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README.md)
-  - [1986.Minimum Number of Work Sessions to Finish the Tasks](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README.md)
-  - [1987.Number of Unique Good Subsequences](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README.md)
-  - [1988.Find Cutoff Score for Each School](/solution/1900-1999/1988.Find%20Cutoff%20Score%20for%20Each%20School/README.md)
+  - [1900.最佳运动员的比拼回合](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README.md)
+  - [1901.找出顶峰元素 II](/solution/1900-1999/1901.Find%20a%20Peak%20Element%20II/README.md)
+  - [1902.给定二叉搜索树的插入顺序求深度](/solution/1900-1999/1902.Depth%20of%20BST%20Given%20Insertion%20Order/README.md)
+  - [1903.字符串中的最大奇数](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README.md)
+  - [1904.你完成的完整对局数](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README.md)
+  - [1905.统计子岛屿](/solution/1900-1999/1905.Count%20Sub%20Islands/README.md)
+  - [1906.查询差绝对值的最小值](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README.md)
+  - [1907.按分类统计薪水](/solution/1900-1999/1907.Count%20Salary%20Categories/README.md)
+  - [1908.Nim 游戏 II](/solution/1900-1999/1908.Game%20of%20Nim/README.md)
+  - [1909.删除一个元素使数组严格递增](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README.md)
+  - [1910.删除一个字符串中所有出现的给定子字符串](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README.md)
+  - [1911.最大子序列交替和](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README.md)
+  - [1912.设计电影租借系统](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README.md)
+  - [1913.两个数对之间的最大乘积差](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README.md)
+  - [1914.循环轮转矩阵](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README.md)
+  - [1915.最美子字符串的数目](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README.md)
+  - [1916.统计为蚁群构筑房间的不同顺序](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README.md)
+  - [1917.Leetcodify 好友推荐](/solution/1900-1999/1917.Leetcodify%20Friends%20Recommendations/README.md)
+  - [1918.第 K 小的子数组和·](/solution/1900-1999/1918.Kth%20Smallest%20Subarray%20Sum/README.md)
+  - [1919.兴趣相同的朋友](/solution/1900-1999/1919.Leetcodify%20Similar%20Friends/README.md)
+  - [1920.基于排列构建数组](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README.md)
+  - [1921.消灭怪物的最大数量](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README.md)
+  - [1922.统计好数字的数目](/solution/1900-1999/1922.Count%20Good%20Numbers/README.md)
+  - [1923.最长公共子路径](/solution/1900-1999/1923.Longest%20Common%20Subpath/README.md)
+  - [1924.安装栅栏 II](/solution/1900-1999/1924.Erect%20the%20Fence%20II/README.md)
+  - [1925.统计平方和三元组的数目](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README.md)
+  - [1926.迷宫中离入口最近的出口](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README.md)
+  - [1927.求和游戏](/solution/1900-1999/1927.Sum%20Game/README.md)
+  - [1928.规定时间内到达终点的最小花费](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README.md)
+  - [1929.数组串联](/solution/1900-1999/1929.Concatenation%20of%20Array/README.md)
+  - [1930.长度为 3 的不同回文子序列](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README.md)
+  - [1931.用三种不同颜色为网格涂色](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README.md)
+  - [1932.合并多棵二叉搜索树](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README.md)
+  - [1933.判断字符串是否可分解为值均等的子串](/solution/1900-1999/1933.Check%20if%20String%20Is%20Decomposable%20Into%20Value-Equal%20Substrings/README.md)
+  - [1934.确认率](/solution/1900-1999/1934.Confirmation%20Rate/README.md)
+  - [1935.可以输入的最大单词数](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README.md)
+  - [1936.新增的最少台阶数](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README.md)
+  - [1937.扣分后的最大得分](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README.md)
+  - [1938.查询最大基因差](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README.md)
+  - [1939.主动请求确认消息的用户](/solution/1900-1999/1939.Users%20That%20Actively%20Request%20Confirmation%20Messages/README.md)
+  - [1940.排序数组之间的最长公共子序列](/solution/1900-1999/1940.Longest%20Common%20Subsequence%20Between%20Sorted%20Arrays/README.md)
+  - [1941.检查是否所有字符出现次数相同](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README.md)
+  - [1942.最小未被占据椅子的编号](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README.md)
+  - [1943.描述绘画结果](/solution/1900-1999/1943.Describe%20the%20Painting/README.md)
+  - [1944.队列中可以看到的人数](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README.md)
+  - [1945.字符串转化后的各位数字之和](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README.md)
+  - [1946.子字符串突变后可能得到的最大整数](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README.md)
+  - [1947.最大兼容性评分和](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README.md)
+  - [1948.删除系统中的重复文件夹](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README.md)
+  - [1949.坚定的友谊](/solution/1900-1999/1949.Strong%20Friendship/README.md)
+  - [1950.所有子数组最小值中的最大值](/solution/1900-1999/1950.Maximum%20of%20Minimum%20Values%20in%20All%20Subarrays/README.md)
+  - [1951.查询具有最多共同关注者的所有两两结对组](/solution/1900-1999/1951.All%20the%20Pairs%20With%20the%20Maximum%20Number%20of%20Common%20Followers/README.md)
+  - [1952.三除数](/solution/1900-1999/1952.Three%20Divisors/README.md)
+  - [1953.你可以工作的最大周数](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README.md)
+  - [1954.收集足够苹果的最小花园周长](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README.md)
+  - [1955.统计特殊子序列的数目](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README.md)
+  - [1956.感染 K 种病毒所需的最短时间](/solution/1900-1999/1956.Minimum%20Time%20For%20K%20Virus%20Variants%20to%20Spread/README.md)
+  - [1957.删除字符使字符串变好](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README.md)
+  - [1958.检查操作是否合法](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README.md)
+  - [1959.K 次调整数组大小浪费的最小总空间](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README.md)
+  - [1960.两个回文子字符串长度的最大乘积](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README.md)
+  - [1961.检查字符串是否为数组前缀](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README.md)
+  - [1962.移除石子使总数最小](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README.md)
+  - [1963.使字符串平衡的最小交换次数](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README.md)
+  - [1964.找出到每个位置为止最长的有效障碍赛跑路线](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README.md)
+  - [1965.丢失信息的雇员](/solution/1900-1999/1965.Employees%20With%20Missing%20Information/README.md)
+  - [1966.未排序数组中的可被二分搜索的数](/solution/1900-1999/1966.Binary%20Searchable%20Numbers%20in%20an%20Unsorted%20Array/README.md)
+  - [1967.作为子字符串出现在单词中的字符串数目](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README.md)
+  - [1968.构造元素不等于两相邻元素平均值的数组](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README.md)
+  - [1969.数组元素的最小非零乘积](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README.md)
+  - [1970.你能穿过矩阵的最后一天](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README.md)
+  - [1971.寻找图中是否存在路径](/solution/1900-1999/1971.Find%20if%20Path%20Exists%20in%20Graph/README.md)
+  - [1972.同一天的第一个电话和最后一个电话](/solution/1900-1999/1972.First%20and%20Last%20Call%20On%20the%20Same%20Day/README.md)
+  - [1973.值等于子节点值之和的节点数量](/solution/1900-1999/1973.Count%20Nodes%20Equal%20to%20Sum%20of%20Descendants/README.md)
+  - [1974.使用特殊打字机键入单词的最少时间](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README.md)
+  - [1975.最大方阵和](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README.md)
+  - [1976.到达目的地的方案数](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README.md)
+  - [1977.划分数字的方案数](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README.md)
+  - [1978.上级经理已离职的公司员工](/solution/1900-1999/1978.Employees%20Whose%20Manager%20Left%20the%20Company/README.md)
+  - [1979.找出数组的最大公约数](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README.md)
+  - [1980.找出不同的二进制字符串](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README.md)
+  - [1981.最小化目标值与所选元素的差](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README.md)
+  - [1982.从子集的和还原数组](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README.md)
+  - [1983.范围和相等的最宽索引对](/solution/1900-1999/1983.Widest%20Pair%20of%20Indices%20With%20Equal%20Range%20Sum/README.md)
+  - [1984.学生分数的最小差值](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README.md)
+  - [1985.找出数组中的第 K 大整数](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README.md)
+  - [1986.完成任务的最少工作时间段](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README.md)
+  - [1987.不同的好子序列数目](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README.md)
+  - [1988.找出每所学校的最低分数要求](/solution/1900-1999/1988.Find%20Cutoff%20Score%20for%20Each%20School/README.md)
   - [1989.Maximum Number of People That Can Be Caught in Tag](/solution/1900-1999/1989.Maximum%20Number%20of%20People%20That%20Can%20Be%20Caught%20in%20Tag/README.md)
-  - [1990.Count the Number of Experiments](/solution/1900-1999/1990.Count%20the%20Number%20of%20Experiments/README.md)
-  - [1991.Find the Middle Index in Array](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md)
-  - [1992.Find All Groups of Farmland](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README.md)
-  - [1993.Operations on Tree](/solution/1900-1999/1993.Operations%20on%20Tree/README.md)
-  - [1994.The Number of Good Subsets](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README.md)
-  - [1995.Count Special Quadruplets](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README.md)
-  - [1996.The Number of Weak Characters in the Game](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README.md)
-  - [1997.First Day Where You Have Been in All the Rooms](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README.md)
-  - [1998.GCD Sort of an Array](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README.md)
-  - [1999.Smallest Greater Multiple Made of Two Digits](/solution/1900-1999/1999.Smallest%20Greater%20Multiple%20Made%20of%20Two%20Digits/README.md)
+  - [1990.统计实验的数量](/solution/1900-1999/1990.Count%20the%20Number%20of%20Experiments/README.md)
+  - [1991.找到数组的中间位置](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md)
+  - [1992.找到所有的农场组](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README.md)
+  - [1993.树上的操作](/solution/1900-1999/1993.Operations%20on%20Tree/README.md)
+  - [1994.好子集的数目](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README.md)
+  - [1995.统计特殊四元组](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README.md)
+  - [1996.游戏中弱角色的数量](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README.md)
+  - [1997.访问完所有房间的第一天](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README.md)
+  - [1998.数组的最大公因数排序](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README.md)
+  - [1999.最小的仅由两个数组成的倍数](/solution/1900-1999/1999.Smallest%20Greater%20Multiple%20Made%20of%20Two%20Digits/README.md)
 
 - 2000-2099
-  - [2000.Reverse Prefix of Word](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README.md)
-  - [2001.Number of Pairs of Interchangeable Rectangles](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README.md)
-  - [2002.Maximum Product of the Length of Two Palindromic Subsequences](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README.md)
-  - [2003.Smallest Missing Genetic Value in Each Subtree](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README.md)
-  - [2004.The Number of Seniors and Juniors to Join the Company](/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README.md)
-  - [2005.Subtree Removal Game with Fibonacci Tree](/solution/2000-2099/2005.Subtree%20Removal%20Game%20with%20Fibonacci%20Tree/README.md)
-  - [2006.Count Number of Pairs With Absolute Difference K](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README.md)
-  - [2007.Find Original Array From Doubled Array](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README.md)
-  - [2008.Maximum Earnings From Taxi](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md)
-  - [2009.Minimum Number of Operations to Make Array Continuous](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README.md)
-  - [2010.The Number of Seniors and Juniors to Join the Company II](/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README.md)
-  - [2011.Final Value of Variable After Performing Operations](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README.md)
-  - [2012.Sum of Beauty in the Array](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README.md)
-  - [2013.Detect Squares](/solution/2000-2099/2013.Detect%20Squares/README.md)
-  - [2014.Longest Subsequence Repeated k Times](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README.md)
-  - [2015.Average Height of Buildings in Each Segment](/solution/2000-2099/2015.Average%20Height%20of%20Buildings%20in%20Each%20Segment/README.md)
-  - [2016.Maximum Difference Between Increasing Elements](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README.md)
-  - [2017.Grid Game](/solution/2000-2099/2017.Grid%20Game/README.md)
-  - [2018.Check if Word Can Be Placed In Crossword](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README.md)
-  - [2019.The Score of Students Solving Math Expression](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README.md)
-  - [2020.Number of Accounts That Did Not Stream](/solution/2000-2099/2020.Number%20of%20Accounts%20That%20Did%20Not%20Stream/README.md)
-  - [2021.Brightest Position on Street](/solution/2000-2099/2021.Brightest%20Position%20on%20Street/README.md)
-  - [2022.Convert 1D Array Into 2D Array](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README.md)
-  - [2023.Number of Pairs of Strings With Concatenation Equal to Target](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README.md)
-  - [2024.Maximize the Confusion of an Exam](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README.md)
-  - [2025.Maximum Number of Ways to Partition an Array](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README.md)
-  - [2026.Low-Quality Problems](/solution/2000-2099/2026.Low-Quality%20Problems/README.md)
-  - [2027.Minimum Moves to Convert String](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README.md)
-  - [2028.Find Missing Observations](/solution/2000-2099/2028.Find%20Missing%20Observations/README.md)
-  - [2029.Stone Game IX](/solution/2000-2099/2029.Stone%20Game%20IX/README.md)
-  - [2030.Smallest K-Length Subsequence With Occurrences of a Letter](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README.md)
-  - [2031.Count Subarrays With More Ones Than Zeros](/solution/2000-2099/2031.Count%20Subarrays%20With%20More%20Ones%20Than%20Zeros/README.md)
-  - [2032.Two Out of Three](/solution/2000-2099/2032.Two%20Out%20of%20Three/README.md)
-  - [2033.Minimum Operations to Make a Uni-Value Grid](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README.md)
-  - [2034.Stock Price Fluctuation](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README.md)
-  - [2035.Partition Array Into Two Arrays to Minimize Sum Difference](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README.md)
-  - [2036.Maximum Alternating Subarray Sum](/solution/2000-2099/2036.Maximum%20Alternating%20Subarray%20Sum/README.md)
-  - [2037.Minimum Number of Moves to Seat Everyone](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README.md)
-  - [2038.Remove Colored Pieces if Both Neighbors are the Same Color](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README.md)
-  - [2039.The Time When the Network Becomes Idle](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README.md)
-  - [2040.Kth Smallest Product of Two Sorted Arrays](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README.md)
-  - [2041.Accepted Candidates From the Interviews](/solution/2000-2099/2041.Accepted%20Candidates%20From%20the%20Interviews/README.md)
-  - [2042.Check if Numbers Are Ascending in a Sentence](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README.md)
-  - [2043.Simple Bank System](/solution/2000-2099/2043.Simple%20Bank%20System/README.md)
-  - [2044.Count Number of Maximum Bitwise-OR Subsets](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README.md)
-  - [2045.Second Minimum Time to Reach Destination](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README.md)
-  - [2046.Sort Linked List Already Sorted Using Absolute Values](/solution/2000-2099/2046.Sort%20Linked%20List%20Already%20Sorted%20Using%20Absolute%20Values/README.md)
-  - [2047.Number of Valid Words in a Sentence](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README.md)
-  - [2048.Next Greater Numerically Balanced Number](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README.md)
-  - [2049.Count Nodes With the Highest Score](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README.md)
-  - [2050.Parallel Courses III](/solution/2000-2099/2050.Parallel%20Courses%20III/README.md)
+  - [2000.反转单词前缀](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README.md)
+  - [2001.可互换矩形的组数](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README.md)
+  - [2002.两个回文子序列长度的最大乘积](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README.md)
+  - [2003.每棵子树内缺失的最小基因值](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README.md)
+  - [2004.职员招聘人数](/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README.md)
+  - [2005.斐波那契树的移除子树游戏](/solution/2000-2099/2005.Subtree%20Removal%20Game%20with%20Fibonacci%20Tree/README.md)
+  - [2006.差的绝对值为 K 的数对数目](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README.md)
+  - [2007.从双倍数组中还原原数组](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README.md)
+  - [2008.出租车的最大盈利](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md)
+  - [2009.使数组连续的最少操作数](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README.md)
+  - [2010.职员招聘人数 II](/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README.md)
+  - [2011.执行操作后的变量值](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README.md)
+  - [2012.数组美丽值求和](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README.md)
+  - [2013.检测正方形](/solution/2000-2099/2013.Detect%20Squares/README.md)
+  - [2014.重复 K 次的最长子序列](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README.md)
+  - [2015.每段建筑物的平均高度](/solution/2000-2099/2015.Average%20Height%20of%20Buildings%20in%20Each%20Segment/README.md)
+  - [2016.增量元素之间的最大差值](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README.md)
+  - [2017.网格游戏](/solution/2000-2099/2017.Grid%20Game/README.md)
+  - [2018.判断单词是否能放入填字游戏内](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README.md)
+  - [2019.解出数学表达式的学生分数](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README.md)
+  - [2020.无流量的帐户数](/solution/2000-2099/2020.Number%20of%20Accounts%20That%20Did%20Not%20Stream/README.md)
+  - [2021.街上最亮的位置](/solution/2000-2099/2021.Brightest%20Position%20on%20Street/README.md)
+  - [2022.将一维数组转变成二维数组](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README.md)
+  - [2023.连接后等于目标字符串的字符串对](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README.md)
+  - [2024.考试的最大困扰度](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README.md)
+  - [2025.分割数组的最多方案数](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README.md)
+  - [2026.低质量的问题](/solution/2000-2099/2026.Low-Quality%20Problems/README.md)
+  - [2027.转换字符串的最少操作次数](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README.md)
+  - [2028.找出缺失的观测数据](/solution/2000-2099/2028.Find%20Missing%20Observations/README.md)
+  - [2029.石子游戏 IX](/solution/2000-2099/2029.Stone%20Game%20IX/README.md)
+  - [2030.含特定字母的最小子序列](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README.md)
+  - [2031.1 比 0 多的子数组个数](/solution/2000-2099/2031.Count%20Subarrays%20With%20More%20Ones%20Than%20Zeros/README.md)
+  - [2032.至少在两个数组中出现的值](/solution/2000-2099/2032.Two%20Out%20of%20Three/README.md)
+  - [2033.获取单值网格的最小操作数](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README.md)
+  - [2034.股票价格波动](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README.md)
+  - [2035.将数组分成两个数组并最小化数组和的差](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README.md)
+  - [2036.最大交替子数组和](/solution/2000-2099/2036.Maximum%20Alternating%20Subarray%20Sum/README.md)
+  - [2037.使每位学生都有座位的最少移动次数](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README.md)
+  - [2038.如果相邻两个颜色均相同则删除当前颜色](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README.md)
+  - [2039.网络空闲的时刻](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README.md)
+  - [2040.两个有序数组的第 K 小乘积](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README.md)
+  - [2041.面试中被录取的候选人](/solution/2000-2099/2041.Accepted%20Candidates%20From%20the%20Interviews/README.md)
+  - [2042.检查句子中的数字是否递增](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README.md)
+  - [2043.简易银行系统](/solution/2000-2099/2043.Simple%20Bank%20System/README.md)
+  - [2044.统计按位或能得到最大值的子集数目](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README.md)
+  - [2045.到达目的地的第二短时间](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README.md)
+  - [2046.给按照绝对值排序的链表排序](/solution/2000-2099/2046.Sort%20Linked%20List%20Already%20Sorted%20Using%20Absolute%20Values/README.md)
+  - [2047.句子中的有效单词数](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README.md)
+  - [2048.下一个更大的数值平衡数](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README.md)
+  - [2049.统计最高分的节点数目](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README.md)
+  - [2050.并行课程 III](/solution/2000-2099/2050.Parallel%20Courses%20III/README.md)
   - [2051.The Category of Each Member in the Store](/solution/2000-2099/2051.The%20Category%20of%20Each%20Member%20in%20the%20Store/README.md)
-  - [2052.Minimum Cost to Separate Sentence Into Rows](/solution/2000-2099/2052.Minimum%20Cost%20to%20Separate%20Sentence%20Into%20Rows/README.md)
-  - [2053.Kth Distinct String in an Array](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README.md)
-  - [2054.Two Best Non-Overlapping Events](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README.md)
-  - [2055.Plates Between Candles](/solution/2000-2099/2055.Plates%20Between%20Candles/README.md)
-  - [2056.Number of Valid Move Combinations On Chessboard](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README.md)
-  - [2057.Smallest Index With Equal Value](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README.md)
-  - [2058.Find the Minimum and Maximum Number of Nodes Between Critical Points](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README.md)
-  - [2059.Minimum Operations to Convert Number](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README.md)
-  - [2060.Check if an Original String Exists Given Two Encoded Strings](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README.md)
-  - [2061.Number of Spaces Cleaning Robot Cleaned](/solution/2000-2099/2061.Number%20of%20Spaces%20Cleaning%20Robot%20Cleaned/README.md)
-  - [2062.Count Vowel Substrings of a String](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README.md)
-  - [2063.Vowels of All Substrings](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README.md)
-  - [2064.Minimized Maximum of Products Distributed to Any Store](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README.md)
-  - [2065.Maximum Path Quality of a Graph](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README.md)
-  - [2066.Account Balance](/solution/2000-2099/2066.Account%20Balance/README.md)
+  - [2052.将句子分隔成行的最低成本](/solution/2000-2099/2052.Minimum%20Cost%20to%20Separate%20Sentence%20Into%20Rows/README.md)
+  - [2053.数组中第 K 个独一无二的字符串](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README.md)
+  - [2054.两个最好的不重叠活动](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README.md)
+  - [2055.蜡烛之间的盘子](/solution/2000-2099/2055.Plates%20Between%20Candles/README.md)
+  - [2056.棋盘上有效移动组合的数目](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README.md)
+  - [2057.值相等的最小索引](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README.md)
+  - [2058.找出临界点之间的最小和最大距离](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README.md)
+  - [2059.转化数字的最小运算数](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README.md)
+  - [2060.同源字符串检测](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README.md)
+  - [2061.扫地机器人清扫过的空间个数](/solution/2000-2099/2061.Number%20of%20Spaces%20Cleaning%20Robot%20Cleaned/README.md)
+  - [2062.统计字符串中的元音子字符串](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README.md)
+  - [2063.所有子字符串中的元音](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README.md)
+  - [2064.分配给商店的最多商品的最小值](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README.md)
+  - [2065.最大化一张图中的路径价值](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README.md)
+  - [2066.账户余额](/solution/2000-2099/2066.Account%20Balance/README.md)
   - [2067.Number of Equal Count Substrings](/solution/2000-2099/2067.Number%20of%20Equal%20Count%20Substrings/README.md)
-  - [2068.Check Whether Two Strings are Almost Equivalent](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README.md)
-  - [2069.Walking Robot Simulation II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README.md)
-  - [2070.Most Beautiful Item for Each Query](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README.md)
-  - [2071.Maximum Number of Tasks You Can Assign](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README.md)
-  - [2072.The Winner University](/solution/2000-2099/2072.The%20Winner%20University/README.md)
-  - [2073.Time Needed to Buy Tickets](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README.md)
-  - [2074.Reverse Nodes in Even Length Groups](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README.md)
-  - [2075.Decode the Slanted Ciphertext](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README.md)
-  - [2076.Process Restricted Friend Requests](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README.md)
+  - [2068.检查两个字符串是否几乎相等](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README.md)
+  - [2069.模拟行走机器人 II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README.md)
+  - [2070.每一个查询的最大美丽值](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README.md)
+  - [2071.你可以安排的最多任务数目](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README.md)
+  - [2072.赢得比赛的大学](/solution/2000-2099/2072.The%20Winner%20University/README.md)
+  - [2073.买票需要的时间](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README.md)
+  - [2074.反转偶数长度组的节点](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README.md)
+  - [2075.解码斜向换位密码](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README.md)
+  - [2076.处理含限制条件的好友请求](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README.md)
   - [2077.Paths in Maze That Lead to Same Room](/solution/2000-2099/2077.Paths%20in%20Maze%20That%20Lead%20to%20Same%20Room/README.md)
-  - [2078.Two Furthest Houses With Different Colors](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README.md)
-  - [2079.Watering Plants](/solution/2000-2099/2079.Watering%20Plants/README.md)
-  - [2080.Range Frequency Queries](/solution/2000-2099/2080.Range%20Frequency%20Queries/README.md)
-  - [2081.Sum of k-Mirror Numbers](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README.md)
-  - [2082.The Number of Rich Customers](/solution/2000-2099/2082.The%20Number%20of%20Rich%20Customers/README.md)
-  - [2083.Substrings That Begin and End With the Same Letter](/solution/2000-2099/2083.Substrings%20That%20Begin%20and%20End%20With%20the%20Same%20Letter/README.md)
-  - [2084.Drop Type 1 Orders for Customers With Type 0 Orders](/solution/2000-2099/2084.Drop%20Type%201%20Orders%20for%20Customers%20With%20Type%200%20Orders/README.md)
-  - [2085.Count Common Words With One Occurrence](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README.md)
-  - [2086.Minimum Number of Buckets Required to Collect Rainwater from Houses](/solution/2000-2099/2086.Minimum%20Number%20of%20Buckets%20Required%20to%20Collect%20Rainwater%20from%20Houses/README.md)
-  - [2087.Minimum Cost Homecoming of a Robot in a Grid](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README.md)
-  - [2088.Count Fertile Pyramids in a Land](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README.md)
-  - [2089.Find Target Indices After Sorting Array](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README.md)
-  - [2090.K Radius Subarray Averages](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README.md)
-  - [2091.Removing Minimum and Maximum From Array](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README.md)
-  - [2092.Find All People With Secret](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README.md)
+  - [2078.两栋颜色不同且距离最远的房子](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README.md)
+  - [2079.给植物浇水](/solution/2000-2099/2079.Watering%20Plants/README.md)
+  - [2080.区间内查询数字的频率](/solution/2000-2099/2080.Range%20Frequency%20Queries/README.md)
+  - [2081.k 镜像数字的和](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README.md)
+  - [2082.富有客户的数量](/solution/2000-2099/2082.The%20Number%20of%20Rich%20Customers/README.md)
+  - [2083.求以相同字母开头和结尾的子串总数](/solution/2000-2099/2083.Substrings%20That%20Begin%20and%20End%20With%20the%20Same%20Letter/README.md)
+  - [2084.为订单类型为 0 的客户删除类型为 1 的订单](/solution/2000-2099/2084.Drop%20Type%201%20Orders%20for%20Customers%20With%20Type%200%20Orders/README.md)
+  - [2085.统计出现过一次的公共字符串](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README.md)
+  - [2086.从房屋收集雨水需要的最少水桶数](/solution/2000-2099/2086.Minimum%20Number%20of%20Buckets%20Required%20to%20Collect%20Rainwater%20from%20Houses/README.md)
+  - [2087.网格图中机器人回家的最小代价](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README.md)
+  - [2088.统计农场中肥沃金字塔的数目](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README.md)
+  - [2089.找出数组排序后的目标下标](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README.md)
+  - [2090.半径为 k 的子数组平均值](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README.md)
+  - [2091.从数组中移除最大值和最小值](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README.md)
+  - [2092.找出知晓秘密的所有专家](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README.md)
   - [2093.Minimum Cost to Reach City With Discounts](/solution/2000-2099/2093.Minimum%20Cost%20to%20Reach%20City%20With%20Discounts/README.md)
-  - [2094.Finding 3-Digit Even Numbers](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README.md)
-  - [2095.Delete the Middle Node of a Linked List](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README.md)
-  - [2096.Step-By-Step Directions From a Binary Tree Node to Another](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README.md)
-  - [2097.Valid Arrangement of Pairs](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README.md)
-  - [2098.Subsequence of Size K With the Largest Even Sum](/solution/2000-2099/2098.Subsequence%20of%20Size%20K%20With%20the%20Largest%20Even%20Sum/README.md)
-  - [2099.Find Subsequence of Length K With the Largest Sum](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README.md)
+  - [2094.找出 3 位偶数](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README.md)
+  - [2095.删除链表的中间节点](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README.md)
+  - [2096.从二叉树一个节点到另一个节点每一步的方向](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README.md)
+  - [2097.合法重新排列数对](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README.md)
+  - [2098.长度为 K 的最大偶数和子序列](/solution/2000-2099/2098.Subsequence%20of%20Size%20K%20With%20the%20Largest%20Even%20Sum/README.md)
+  - [2099.找到和最大的长度为 K 的子序列](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README.md)
 
 - 2100-2199
-  - [2100.Find Good Days to Rob the Bank](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README.md)
-  - [2101.Detonate the Maximum Bombs](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README.md)
-  - [2102.Sequentially Ordinal Rank Tracker](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README.md)
-  - [2103.Rings and Rods](/solution/2100-2199/2103.Rings%20and%20Rods/README.md)
-  - [2104.Sum of Subarray Ranges](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README.md)
-  - [2105.Watering Plants II](/solution/2100-2199/2105.Watering%20Plants%20II/README.md)
-  - [2106.Maximum Fruits Harvested After at Most K Steps](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README.md)
-  - [2107.Number of Unique Flavors After Sharing K Candies](/solution/2100-2199/2107.Number%20of%20Unique%20Flavors%20After%20Sharing%20K%20Candies/README.md)
-  - [2108.Find First Palindromic String in the Array](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README.md)
-  - [2109.Adding Spaces to a String](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README.md)
-  - [2110.Number of Smooth Descent Periods of a Stock](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README.md)
-  - [2111.Minimum Operations to Make the Array K-Increasing](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README.md)
+  - [2100.适合打劫银行的日子](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README.md)
+  - [2101.引爆最多的炸弹](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README.md)
+  - [2102.序列顺序查询](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README.md)
+  - [2103.环和杆](/solution/2100-2199/2103.Rings%20and%20Rods/README.md)
+  - [2104.子数组范围和](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README.md)
+  - [2105.给植物浇水 II](/solution/2100-2199/2105.Watering%20Plants%20II/README.md)
+  - [2106.摘水果](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README.md)
+  - [2107.分享 K 个糖果后独特口味的数量](/solution/2100-2199/2107.Number%20of%20Unique%20Flavors%20After%20Sharing%20K%20Candies/README.md)
+  - [2108.找出数组中的第一个回文字符串](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README.md)
+  - [2109.向字符串添加空格](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README.md)
+  - [2110.股票平滑下跌阶段的数目](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README.md)
+  - [2111.使数组 K 递增的最少操作次数](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README.md)
   - [2112.The Airport With the Most Traffic](/solution/2100-2199/2112.The%20Airport%20With%20the%20Most%20Traffic/README.md)
-  - [2113.Elements in Array After Removing and Replacing Elements](/solution/2100-2199/2113.Elements%20in%20Array%20After%20Removing%20and%20Replacing%20Elements/README.md)
-  - [2114.Maximum Number of Words Found in Sentences](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README.md)
-  - [2115.Find All Possible Recipes from Given Supplies](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README.md)
-  - [2116.Check if a Parentheses String Can Be Valid](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md)
-  - [2117.Abbreviating the Product of a Range](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README.md)
+  - [2113.查询删除和添加元素后的数组](/solution/2100-2199/2113.Elements%20in%20Array%20After%20Removing%20and%20Replacing%20Elements/README.md)
+  - [2114.句子中的最多单词数](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README.md)
+  - [2115.从给定原材料中找到所有可以做出的菜](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README.md)
+  - [2116.判断一个括号字符串是否有效](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md)
+  - [2117.一个区间内所有数乘积的缩写](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README.md)
   - [2118.Build the Equation](/solution/2100-2199/2118.Build%20the%20Equation/README.md)
-  - [2119.A Number After a Double Reversal](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README.md)
-  - [2120.Execution of All Suffix Instructions Staying in a Grid](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README.md)
-  - [2121.Intervals Between Identical Elements](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README.md)
-  - [2122.Recover the Original Array](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README.md)
-  - [2123.Minimum Operations to Remove Adjacent Ones in Matrix](/solution/2100-2199/2123.Minimum%20Operations%20to%20Remove%20Adjacent%20Ones%20in%20Matrix/README.md)
-  - [2124.Check if All A's Appears Before All B's](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README.md)
-  - [2125.Number of Laser Beams in a Bank](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README.md)
-  - [2126.Destroying Asteroids](/solution/2100-2199/2126.Destroying%20Asteroids/README.md)
+  - [2119.反转两次的数字](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README.md)
+  - [2120.执行所有后缀指令](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README.md)
+  - [2121.相同元素的间隔之和](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README.md)
+  - [2122.还原原数组](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README.md)
+  - [2123.使矩阵中的 1 互不相邻的最小操作数](/solution/2100-2199/2123.Minimum%20Operations%20to%20Remove%20Adjacent%20Ones%20in%20Matrix/README.md)
+  - [2124.检查是否所有 A 都在 B 之前](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README.md)
+  - [2125.银行中的激光束数量](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README.md)
+  - [2126.摧毁小行星](/solution/2100-2199/2126.Destroying%20Asteroids/README.md)
   - [2127.Maximum Employees to Be Invited to a Meeting](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md)
-  - [2128.Remove All Ones With Row and Column Flips](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README.md)
-  - [2129.Capitalize the Title](/solution/2100-2199/2129.Capitalize%20the%20Title/README.md)
-  - [2130.Maximum Twin Sum of a Linked List](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README.md)
-  - [2131.Longest Palindrome by Concatenating Two Letter Words](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README.md)
-  - [2132.Stamping the Grid](/solution/2100-2199/2132.Stamping%20the%20Grid/README.md)
-  - [2133.Check if Every Row and Column Contains All Numbers](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README.md)
-  - [2134.Minimum Swaps to Group All 1's Together II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README.md)
-  - [2135.Count Words Obtained After Adding a Letter](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README.md)
-  - [2136.Earliest Possible Day of Full Bloom](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README.md)
-  - [2137.Pour Water Between Buckets to Make Water Levels Equal](/solution/2100-2199/2137.Pour%20Water%20Between%20Buckets%20to%20Make%20Water%20Levels%20Equal/README.md)
-  - [2138.Divide a String Into Groups of Size k](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README.md)
-  - [2139.Minimum Moves to Reach Target Score](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README.md)
-  - [2140.Solving Questions With Brainpower](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README.md)
-  - [2141.Maximum Running Time of N Computers](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README.md)
+  - [2128.通过翻转行或列来去除所有的 1](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README.md)
+  - [2129.将标题首字母大写](/solution/2100-2199/2129.Capitalize%20the%20Title/README.md)
+  - [2130.链表最大孪生和](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README.md)
+  - [2131.连接两字母单词得到的最长回文串](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README.md)
+  - [2132.用邮票贴满网格图](/solution/2100-2199/2132.Stamping%20the%20Grid/README.md)
+  - [2133.检查是否每一行每一列都包含全部整数](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README.md)
+  - [2134.最少交换次数来组合所有的 1 II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README.md)
+  - [2135.统计追加字母可以获得的单词数](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README.md)
+  - [2136.全部开花的最早一天](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README.md)
+  - [2137.通过倒水操作让所有的水桶所含水量相等](/solution/2100-2199/2137.Pour%20Water%20Between%20Buckets%20to%20Make%20Water%20Levels%20Equal/README.md)
+  - [2138.将字符串拆分为若干长度为 k 的组](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README.md)
+  - [2139.得到目标值的最少行动次数](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README.md)
+  - [2140.解决智力问题](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README.md)
+  - [2141.同时运行 N 台电脑的最长时间](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README.md)
   - [2142.The Number of Passengers in Each Bus I](/solution/2100-2199/2142.The%20Number%20of%20Passengers%20in%20Each%20Bus%20I/README.md)
-  - [2143.Choose Numbers From Two Arrays in Range](/solution/2100-2199/2143.Choose%20Numbers%20From%20Two%20Arrays%20in%20Range/README.md)
-  - [2144.Minimum Cost of Buying Candies With Discount](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README.md)
-  - [2145.Count the Hidden Sequences](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README.md)
-  - [2146.K Highest Ranked Items Within a Price Range](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README.md)
-  - [2147.Number of Ways to Divide a Long Corridor](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README.md)
-  - [2148.Count Elements With Strictly Smaller and Greater Elements](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README.md)
-  - [2149.Rearrange Array Elements by Sign](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README.md)
-  - [2150.Find All Lonely Numbers in the Array](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README.md)
-  - [2151.Maximum Good People Based on Statements](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README.md)
-  - [2152.Minimum Number of Lines to Cover Points](/solution/2100-2199/2152.Minimum%20Number%20of%20Lines%20to%20Cover%20Points/README.md)
+  - [2143.在两个数组的区间中选取数字](/solution/2100-2199/2143.Choose%20Numbers%20From%20Two%20Arrays%20in%20Range/README.md)
+  - [2144.打折购买糖果的最小开销](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README.md)
+  - [2145.统计隐藏数组数目](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README.md)
+  - [2146.价格范围内最高排名的 K 样物品](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README.md)
+  - [2147.分隔长廊的方案数](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README.md)
+  - [2148.元素计数](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README.md)
+  - [2149.按符号重排数组](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README.md)
+  - [2150.找出数组中的所有孤独数字](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README.md)
+  - [2151.基于陈述统计最多好人数](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README.md)
+  - [2152.穿过所有点的所需最少直线数量](/solution/2100-2199/2152.Minimum%20Number%20of%20Lines%20to%20Cover%20Points/README.md)
   - [2153.The Number of Passengers in Each Bus II](/solution/2100-2199/2153.The%20Number%20of%20Passengers%20in%20Each%20Bus%20II/README.md)
-  - [2154.Keep Multiplying Found Values by Two](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README.md)
-  - [2155.All Divisions With the Highest Score of a Binary Array](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README.md)
-  - [2156.Find Substring With Given Hash Value](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README.md)
-  - [2157.Groups of Strings](/solution/2100-2199/2157.Groups%20of%20Strings/README.md)
+  - [2154.将找到的值乘以 2](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README.md)
+  - [2155.分组得分最高的所有下标](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README.md)
+  - [2156.查找给定哈希值的子串](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README.md)
+  - [2157.字符串分组](/solution/2100-2199/2157.Groups%20of%20Strings/README.md)
   - [2158.Amount of New Area Painted Each Day](/solution/2100-2199/2158.Amount%20of%20New%20Area%20Painted%20Each%20Day/README.md)
   - [2159.Order Two Columns Independently](/solution/2100-2199/2159.Order%20Two%20Columns%20Independently/README.md)
-  - [2160.Minimum Sum of Four Digit Number After Splitting Digits](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README.md)
-  - [2161.Partition Array According to Given Pivot](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README.md)
-  - [2162.Minimum Cost to Set Cooking Time](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README.md)
-  - [2163.Minimum Difference in Sums After Removal of Elements](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README.md)
-  - [2164.Sort Even and Odd Indices Independently](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README.md)
-  - [2165.Smallest Value of the Rearranged Number](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README.md)
-  - [2166.Design Bitset](/solution/2100-2199/2166.Design%20Bitset/README.md)
-  - [2167.Minimum Time to Remove All Cars Containing Illegal Goods](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README.md)
-  - [2168.Unique Substrings With Equal Digit Frequency](/solution/2100-2199/2168.Unique%20Substrings%20With%20Equal%20Digit%20Frequency/README.md)
-  - [2169.Count Operations to Obtain Zero](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README.md)
-  - [2170.Minimum Operations to Make the Array Alternating](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README.md)
-  - [2171.Removing Minimum Number of Magic Beans](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README.md)
-  - [2172.Maximum AND Sum of Array](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README.md)
-  - [2173.Longest Winning Streak](/solution/2100-2199/2173.Longest%20Winning%20Streak/README.md)
+  - [2160.拆分数位后四位数字的最小和](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README.md)
+  - [2161.根据给定数字划分数组](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README.md)
+  - [2162.设置时间的最少代价](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README.md)
+  - [2163.删除元素后和的最小差值](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README.md)
+  - [2164.对奇偶下标分别排序](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README.md)
+  - [2165.重排数字的最小值](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README.md)
+  - [2166.设计位集](/solution/2100-2199/2166.Design%20Bitset/README.md)
+  - [2167.移除所有载有违禁货物车厢所需的最少时间](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README.md)
+  - [2168.每个数字的频率都相同的独特子字符串的数量](/solution/2100-2199/2168.Unique%20Substrings%20With%20Equal%20Digit%20Frequency/README.md)
+  - [2169.得到 0 的操作数](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README.md)
+  - [2170.使数组变成交替数组的最少操作数](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README.md)
+  - [2171.拿出最少数目的魔法豆](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README.md)
+  - [2172.数组的最大与和](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README.md)
+  - [2173.最多连胜的次数](/solution/2100-2199/2173.Longest%20Winning%20Streak/README.md)
   - [2174.Remove All Ones With Row and Column Flips II](/solution/2100-2199/2174.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips%20II/README.md)
   - [2175.The Change in Global Rankings](/solution/2100-2199/2175.The%20Change%20in%20Global%20Rankings/README.md)
-  - [2176.Count Equal and Divisible Pairs in an Array](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README.md)
-  - [2177.Find Three Consecutive Integers That Sum to a Given Number](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README.md)
-  - [2178.Maximum Split of Positive Even Integers](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README.md)
-  - [2179.Count Good Triplets in an Array](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README.md)
-  - [2180.Count Integers With Even Digit Sum](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README.md)
-  - [2181.Merge Nodes in Between Zeros](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README.md)
-  - [2182.Construct String With Repeat Limit](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README.md)
-  - [2183.Count Array Pairs Divisible by K](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README.md)
+  - [2176.统计数组中相等且可以被整除的数对](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README.md)
+  - [2177.找到和为给定整数的三个连续整数](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README.md)
+  - [2178.拆分成最多数目的正偶数之和](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README.md)
+  - [2179.统计数组中好三元组数目](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README.md)
+  - [2180.统计各位数字之和为偶数的整数个数](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README.md)
+  - [2181.合并零之间的节点](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README.md)
+  - [2182.构造限制重复的字符串](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README.md)
+  - [2183.统计可以被 K 整除的下标对数目](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README.md)
   - [2184.Number of Ways to Build Sturdy Brick Wall](/solution/2100-2199/2184.Number%20of%20Ways%20to%20Build%20Sturdy%20Brick%20Wall/README.md)
-  - [2185.Counting Words With a Given Prefix](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README.md)
-  - [2186.Minimum Number of Steps to Make Two Strings Anagram II](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README.md)
-  - [2187.Minimum Time to Complete Trips](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README.md)
-  - [2188.Minimum Time to Finish the Race](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README.md)
+  - [2185.统计包含给定前缀的字符串](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README.md)
+  - [2186.使两字符串互为字母异位词的最少步骤数](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README.md)
+  - [2187.完成旅途的最少时间](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README.md)
+  - [2188.完成比赛的最少时间](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README.md)
   - [2189.Number of Ways to Build House of Cards](/solution/2100-2199/2189.Number%20of%20Ways%20to%20Build%20House%20of%20Cards/README.md)
-  - [2190.Most Frequent Number Following Key In an Array](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README.md)
-  - [2191.Sort the Jumbled Numbers](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README.md)
-  - [2192.All Ancestors of a Node in a Directed Acyclic Graph](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README.md)
-  - [2193.Minimum Number of Moves to Make Palindrome](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README.md)
-  - [2194.Cells in a Range on an Excel Sheet](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README.md)
-  - [2195.Append K Integers With Minimal Sum](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README.md)
-  - [2196.Create Binary Tree From Descriptions](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README.md)
-  - [2197.Replace Non-Coprime Numbers in Array](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README.md)
+  - [2190.数组中紧跟 key 之后出现最频繁的数字](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README.md)
+  - [2191.将杂乱无章的数字排序](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README.md)
+  - [2192.有向无环图中一个节点的所有祖先](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README.md)
+  - [2193.得到回文串的最少操作次数](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README.md)
+  - [2194.Excel 表中某个范围内的单元格](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README.md)
+  - [2195.向数组中追加 K 个整数](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README.md)
+  - [2196.根据描述创建二叉树](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README.md)
+  - [2197.替换数组中的非互质数](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README.md)
   - [2198.Number of Single Divisor Triplets](/solution/2100-2199/2198.Number%20of%20Single%20Divisor%20Triplets/README.md)
   - [2199.Finding the Topic of Each Post](/solution/2100-2199/2199.Finding%20the%20Topic%20of%20Each%20Post/README.md)
 
 - 2200-2299
-  - [2200.Find All K-Distant Indices in an Array](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README.md)
-  - [2201.Count Artifacts That Can Be Extracted](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README.md)
-  - [2202.Maximize the Topmost Element After K Moves](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README.md)
-  - [2203.Minimum Weighted Subgraph With the Required Paths](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README.md)
+  - [2200.找出数组中的所有 K 近邻下标](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README.md)
+  - [2201.统计可以提取的工件](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README.md)
+  - [2202.K 次操作后最大化顶端元素](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README.md)
+  - [2203.得到要求路径的最小带权子图](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README.md)
   - [2204.Distance to a Cycle in Undirected Graph](/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README.md)
   - [2205.The Number of Users That Are Eligible for Discount](/solution/2200-2299/2205.The%20Number%20of%20Users%20That%20Are%20Eligible%20for%20Discount/README.md)
-  - [2206.Divide Array Into Equal Pairs](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README.md)
-  - [2207.Maximize Number of Subsequences in a String](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README.md)
-  - [2208.Minimum Operations to Halve Array Sum](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README.md)
-  - [2209.Minimum White Tiles After Covering With Carpets](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README.md)
-  - [2210.Count Hills and Valleys in an Array](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README.md)
-  - [2211.Count Collisions on a Road](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README.md)
-  - [2212.Maximum Points in an Archery Competition](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README.md)
-  - [2213.Longest Substring of One Repeating Character](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README.md)
+  - [2206.将数组划分成相等数对](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README.md)
+  - [2207.字符串中最多数目的子字符串](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README.md)
+  - [2208.将数组和减半的最少操作次数](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README.md)
+  - [2209.用地毯覆盖后的最少白色砖块](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README.md)
+  - [2210.统计数组中峰和谷的数量](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README.md)
+  - [2211.统计道路上的碰撞次数](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README.md)
+  - [2212.射箭比赛中的最大得分](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README.md)
+  - [2213.由单个字符重复的最长子字符串](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README.md)
   - [2214.Minimum Health to Beat Game](/solution/2200-2299/2214.Minimum%20Health%20to%20Beat%20Game/README.md)
-  - [2215.Find the Difference of Two Arrays](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README.md)
-  - [2216.Minimum Deletions to Make Array Beautiful](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README.md)
-  - [2217.Find Palindrome With Fixed Length](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README.md)
-  - [2218.Maximum Value of K Coins From Piles](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README.md)
+  - [2215.找出两数组的不同](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README.md)
+  - [2216.美化数组的最少删除数](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README.md)
+  - [2217.找到指定长度的回文数](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README.md)
+  - [2218.从栈中取出 K 个硬币的最大面值和](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README.md)
   - [2219.Maximum Sum Score of Array](/solution/2200-2299/2219.Maximum%20Sum%20Score%20of%20Array/README.md)
-  - [2220.Minimum Bit Flips to Convert Number](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README.md)
-  - [2221.Find Triangular Sum of an Array](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README.md)
-  - [2222.Number of Ways to Select Buildings](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README.md)
-  - [2223.Sum of Scores of Built Strings](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README.md)
-  - [2224.Minimum Number of Operations to Convert Time](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README.md)
-  - [2225.Find Players With Zero or One Losses](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README.md)
-  - [2226.Maximum Candies Allocated to K Children](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README.md)
-  - [2227.Encrypt and Decrypt Strings](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README.md)
+  - [2220.转换数字的最少位翻转次数](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README.md)
+  - [2221.数组的三角和](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README.md)
+  - [2222.选择建筑的方案数](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README.md)
+  - [2223.构造字符串的总得分和](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README.md)
+  - [2224.转化时间需要的最少操作数](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README.md)
+  - [2225.找出输掉零场或一场比赛的玩家](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README.md)
+  - [2226.每个小孩最多能分到多少糖果](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README.md)
+  - [2227.加密解密字符串](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README.md)
   - [2228.Users With Two Purchases Within Seven Days](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README.md)
   - [2229.Check if an Array Is Consecutive](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README.md)
   - [2230.The Users That Are Eligible for Discount](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README.md)
-  - [2231.Largest Number After Digit Swaps by Parity](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md)
-  - [2232.Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md)
-  - [2233.Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md)
-  - [2234.Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md)
+  - [2231.按奇偶性交换后的最大数字](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md)
+  - [2232.向表达式添加括号后的最小结果](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md)
+  - [2233.K 次增加后的最大乘积](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md)
+  - [2234.花园的最大总美丽值](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md)
