fix: #2

Author: lucifer

package.json

@@ -23,7 +23,7 @@
     "test": "react-scripts test",
     "eject": "react-scripts eject",
     "crawl": "node scripts/curlLeetcode.js && node scripts/generateLeetcode.js",
-    "clean": "rm -f src/db/root.db.js"
+    "clean": "rm -f src/db/root.db.js && rm -rf spider/"
   },
   "browserslist": {
     "production": [

public/logo.png

@@ -129,15 +129,11 @@ function App() {
                 </a>
               </Fragment>
             )}
-            {problems[problemId].keyPoints.map(({ id, link, text, color }) => (
-              <TagOrLink
-                key={text}
-                text={text}
-                link={link}
-                color={color}
-                style={{ marginBottom: 6 }}
-              />
-            ))}
+            <ul>
+              {problems[problemId].keyPoints.map(({ id, link, text }) => (
+                <li key={id}>{link ? <a href={link}>text</a> : text}</li>
+              ))}
+            </ul>
           </TabPane>
           <TabPane tab="公司" key="4">
             {problems[problemId].companies.length === 0 && (

src/App.js

@@ -166,9 +166,9 @@
         }
     ]
 },
-"median-of-two-sorted-array":{
+"median-of-two-sorted-arrays":{
     "id": "4",
-    "name": "median-of-two-sorted-array",
+    "name": "median-of-two-sorted-arrays",
     "pre": [
         {
             "text": "中位数",
@@ -219,8 +219,8 @@
             "name": "腾讯"
         }
     ],
-    "giteeSolution": "https://gitee.com/golong/leetcode/blob/master/problems/4.median-of-two-sorted-array.md",
-    "solution": "https://github.com/azl397985856/leetcode/blob/master/problems/4.median-of-two-sorted-array.md",
+    "giteeSolution": "https://gitee.com/golong/leetcode/blob/master/problems/4.median-of-two-sorted-arrays.md",
+    "solution": "https://github.com/azl397985856/leetcode/blob/master/problems/4.median-of-two-sorted-arrays.md",
     "code": [
         {
             "language": "java",
@@ -333,9 +333,9 @@
         }
     ]
 },
-"3-sum":{
+"3sum":{
     "id": "15",
-    "name": "3-sum",
+    "name": "3sum",
     "pre": [
         {
             "text": "排序",
@@ -373,8 +373,8 @@
             "name": "字节跳动"
         }
     ],
-    "giteeSolution": "https://gitee.com/golong/leetcode/blob/master/problems/15.3-sum.md",
-    "solution": "https://github.com/azl397985856/leetcode/blob/master/problems/15.3-sum.md",
+    "giteeSolution": "https://gitee.com/golong/leetcode/blob/master/problems/15.3sum.md",
+    "solution": "https://github.com/azl397985856/leetcode/blob/master/problems/15.3sum.md",
     "code": [
         {
             "language": "js",
@@ -7071,21 +7071,6 @@
         }
     ]
 },
-"Find-Mode-in-Binary-Search-Tree":{
-    "id": "501",
-    "name": "Find-Mode-in-Binary-Search-Tree",
-    "pre": [],
-    "keyPoints": [],
-    "companies": [],
-    "giteeSolution": "https://gitee.com/golong/leetcode/blob/master/problems/501.Find-Mode-in-Binary-Search-Tree.md",
-    "solution": "https://github.com/azl397985856/leetcode/blob/master/problems/501.Find-Mode-in-Binary-Search-Tree.md",
-    "code": [
-        {
-            "language": "java",
-            "text": "\n/**\n * Definition for a binary tree node.\n * public class TreeNode {\n *     int val;\n *     TreeNode left;\n *     TreeNode right;\n *     TreeNode(int x) { val = x; }\n * }\n */\nclass Solution {   \n    List<Integer> list = new ArrayList<> ();\n    TreeNode preNode = null;\n    int max = 0, count = 0;\n    \n    public int[] findMode(TreeNode root) {\n        helper(root);\n        int[] res = new int[list.size()];\n        for (int i=0; i<res.length; i++) {\n            res[i] = list.get(i);\n        }\n        return res;\n    }\n    \n    private void helper (TreeNode root) {\n        if (root == null) return;\n        helper(root.left);\n        \n        if (preNode != null && root.val == preNode.val) {\n            count++;\n        } else {\n            count = 1;\n        }\n        \n        if (count > max) {\n            list.clear();\n            list.add(root.val);\n            max = count;\n        } else if (max == count) {\n            list.add(root.val);            \n        }\n        preNode = root;\n        helper(root.right);\n    }\n}\n"
-        }
-    ]
-},
 "longest-palindromic-subsequence":{
     "id": "516",
     "name": "longest-palindromic-subsequence",