update

leetcode-cn/originData/zhong-jian-er-cha-shu-lcof.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>输入某二叉树的前序遍历和中序遍历的结果，请构建该二叉树并返回其根节点。</p>\n\n<p>假设输入的前序遍历和中序遍历的结果中都不含重复的数字。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/02/19/tree.jpg\" />\n<pre>\n<strong>Input:</strong> preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]\n<strong>Output:</strong> [3,9,20,null,null,15,7]\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> preorder = [-1], inorder = [-1]\n<strong>Output:</strong> [-1]\n</pre>\n\n<p> </p>\n\n<p><strong>限制：</strong></p>\n\n<p><code>0 <= 节点个数 <= 5000</code></p>\n\n<p> </p>\n\n<p><strong>注意</strong>：本题与主站 105 题重复：<a href=\"https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/\">https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/</a></p>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 730,
+            "likes": 757,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -161,7 +161,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"237.6K\", \"totalSubmission\": \"338.5K\", \"totalAcceptedRaw\": 237591, \"totalSubmissionRaw\": 338523, \"acRate\": \"70.2%\"}",
+            "stats": "{\"totalAccepted\": \"247.9K\", \"totalSubmission\": \"353K\", \"totalAcceptedRaw\": 247926, \"totalSubmissionRaw\": 353021, \"acRate\": \"70.2%\"}",
             "hints": [],
             "solution": null,
             "status": null,