feat: 更新题库，代码模板

Author: robot

src/codeTemplates/index.js

@@ -10,6 +10,7 @@ import preSum from "./preSum";
 import handWriting from "./hand-writing";
 import rotate from "./rotate";
 import grapth from "./grapth";
+import prime from './prime'
 export default [
   preSum,
   grapth,
@@ -23,4 +24,5 @@ export default [
   segmemntTree,
   handWriting,
   rotate,
+  prime
 ];

src/codeTemplates/prime.js

@@ -0,0 +1,31 @@
+const pyCode = `
+MAXN = int(1e5)
+flag = [True] * (MAXN + 10) # if flag[i] is true, then i is prime
+flag[0], flag[1] = False, False
+for i in range(2, int(MAXN ** 0.5) + 1):
+    if flag[i]:
+        for j in range(i * 2, MAXN + 1, i):
+            flag[j] = False
+`
+
+module.exports = {
+    title: "求质数",
+    // logo: require("../imgs/preSum.svg"),
+    list: [
+      {
+        text: "质数筛选法",
+        problems: [
+          {
+            title: "2867. 统计树中的合法路径数目",
+            id: "count-valid-paths-in-a-tree",
+          },
+        ],
+        codes: [
+          {
+            language: "py",
+            text: pyCode,
+          },
+        ],
+      },
+    ]
+  };

src/db/root.db.js

@@ -2565,60 +2565,12 @@
 "sort-colors":{
     "id": "75",
     "name": "sort-colors",
-    "pre": [
-        {
-            "text": "荷兰国旗问题",
-            "link": "https://en.wikipedia.org/wiki/Dutch_national_flag_problem",
-            "color": "purple"
-        },
-        {
-            "text": "排序",
-            "link": null,
-            "color": "purple"
-        }
-    ],
-    "keyPoints": [
-        {
-            "text": "荷兰国旗问题",
-            "link": null,
-            "color": "blue"
-        },
-        {
-            "text": "countingsort",
-            "link": null,
-            "color": "blue"
-        }
-    ],
-    "companies": [
-        {
-            "name": "阿里巴巴"
-        },
-        {
-            "name": "腾讯"
-        },
-        {
-            "name": "百度"
-        },
-        {
-            "name": "字节跳动"
-        }
-    ],
+    "pre": [],
+    "keyPoints": [],
+    "companies": [],
     "giteeSolution": "https://gitee.com/golong/leetcode/blob/master/problems/75.sort-colors.md",
     "solution": "https://github.com/azl397985856/leetcode/blob/master/problems/75.sort-colors.md",
-    "code": [
-        {
-            "language": "cpp",
-            "text": "\nclass Solution {\npublic:\n    void sortColors(vector<int>& nums) {\n        int r = 0, g = 0, b = 0;\n        for (int n : nums) {\n            if (n == 0) {\n                nums[b++] = 2;\n                nums[g++] = 1;\n                nums[r++] = 0;\n            } else if (n == 1) {\n                nums[b++] = 2;\n                nums[g++] = 1;\n            } else nums[b++] = 2;\n        }\n    }\n};\n"
-        },
-        {
-            "language": "py",
-            "text": "\nclass Solution:\n    def sortColors(self, strs):\n        # p0 是右边界\n        # p1 是右边界\n        # p2 是左边界\n        # p1 超过 p2 结束\n        p0, p1, p2 = 0, 0, len(strs) - 1\n\n        while p1 <= p2:\n            if strs[p1] == 'blue':\n                strs[p2], strs[p1] = strs[p1], strs[p2]\n                p2 -= 1\n            elif strs[p1] == 'red':\n                strs[p0], strs[p1] = strs[p1], strs[p0]\n                p0 += 1\n                p1 += 1 # p0 一定不是 blue，因此 p1 += 1\n            else: # p1 === 'green'\n                p1 += 1\n        return strs\n"
-        },
-        {
-            "language": "py",
-            "text": "\nclass Solution:\n    def partition(self, head: ListNode, x: int) -> ListNode:\n        l1 = cur = head\n        while cur:\n            if cur.val < x:\n                cur.val, l1.val = l1.val, cur.val\n                l1 = l1.next\n            cur = cur.next\n        return head\n"
-        }
-    ]
+    "code": []
 },
 "subsets":{
     "id": "78",
@@ -13426,6 +13378,38 @@
         }
     ]
 },
+"maximum-score-of-a-good-subarray":{
+    "id": "1793",
+    "name": "maximum-score-of-a-good-subarray",
+    "pre": [
+        {
+            "text": "单调栈",
+            "link": null,
+            "color": "purple"
+        }
+    ],
+    "keyPoints": [
+        {
+            "text": "贡献法",
+            "link": null,
+            "color": "blue"
+        },
+        {
+            "text": "单调栈",
+            "link": null,
+            "color": "blue"
+        }
+    ],
+    "companies": [],
+    "giteeSolution": "https://gitee.com/golong/leetcode/blob/master/problems/1793.maximum-score-of-a-good-subarray.md",
+    "solution": "https://github.com/azl397985856/leetcode/blob/master/problems/1793.maximum-score-of-a-good-subarray.md",
+    "code": [
+        {
+            "language": "py",
+            "text": "\nclass Solution:\n    def maximumScore(self, nums: List[int], k: int) -> int:\n        # 单调栈求出 nums[i] 的下一个更小的下标 j\n        st = []\n        ans = 0\n        nums += [0]\n        for i in range(len(nums)):\n            while st and nums[st[-1]] > nums[i]:\n                # 含义：st[-1] 的下一个更小的是 i\n                left = st[-2] if len(st) > 1 else -1 # 注意这里是 -2，因为 st[-1] 是当前元素， 我们要在当前元素的左边记录找。也可以先 st.pop() 后在 st[-1]\n                if left < k < i: # 注意由于 left 和 i 我们都无法取到（开区间），因此这里不能有等号\n                    ans = max(ans, (i - left - 1) * nums[st[-1]])\n                st.pop()\n            st.append(i)\n        return ans\n"
+        }
+    ]
+},
 "single-threaded-cpu":{
     "id": "1834",
     "name": "single-threaded-cpu",
@@ -14102,6 +14086,31 @@
         }
     ]
 },
+"minimum-absolute-difference-between-elements-with-constraint":{
+    "id": "2817",
+    "name": "minimum-absolute-difference-between-elements-with-constraint",
+    "pre": [
+        {
+            "text": "二分查找",
+            "link": null,
+            "color": "magenta"
+        }
+    ],
+    "keyPoints": [],
+    "companies": [],
+    "giteeSolution": "https://gitee.com/golong/leetcode/blob/master/problems/2817.minimum-absolute-difference-between-elements-with-constraint.md",
+    "solution": "https://github.com/azl397985856/leetcode/blob/master/problems/2817.minimum-absolute-difference-between-elements-with-constraint.md",
+    "code": [
+        {
+            "language": "py",
+            "text": "\nclass Solution:\n    def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n        n = len(nums)\n        minDiff = float('inf')\n\n        for i in range(n):\n            for j in range(i + x, n):\n                absDiff = abs(nums[i] - nums[j])\n                if absDiff < minDiff:\n                    minDiff = absDiff\n\n        return minDiff\n\n"
+        },
+        {
+            "language": "py",
+            "text": "\nfrom sortedcontainers import SortedList\n\nclass Solution:\n    def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n        n = len(nums)\n\n        # 初始化答案为无穷大\n        res = float('inf')  \n\n        # 维护前面元素的有序序列\n        ls = SortedList()  \n\n        for i in range(n - x):\n\n            # 将nums[i]加入有序序列ls，SortedList保证插入后仍然有序\n            v = nums[i]\n            ls.add(v) \n\n            # 使用二分查找寻找前面序列中最后一个<=nums[i+x]的元素\n            v = nums[i + x]\n            idx = ls.bisect_right(v)\n\n            # 使用和nums[i+x]最接近的元素更新答案,将答案更新为当前答案和新差值中的较小值\n            res = min(res, abs(v - ls[idx - 1]))\n\n            # 如果存在更接近的元素，也尝试更新答案\n            if idx < len(ls):  \n                res = min(res, abs(ls[idx] - v))\n\n        return res\n"
+        }
+    ]
+},
 "selling-pieces-of-wood":{
     "id": "5254",
     "name": "selling-pieces-of-wood",