update

leetcode-cn/originData/construct-binary-search-tree-from-preorder-traversal.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个整数数组，它表示BST(即 <strong>二叉搜索树</strong> )的 <strong>先</strong><strong>序遍历</strong> ，构造树并返回其根。</p>\n\n<p><strong>保证</strong> 对于给定的测试用例，总是有可能找到具有给定需求的二叉搜索树。</p>\n\n<p><strong>二叉搜索树</strong> 是一棵二叉树，其中每个节点，&nbsp;<code>Node.left</code>&nbsp;的任何后代的值 <strong>严格小于</strong> <code>Node.val</code>&nbsp;,&nbsp;<code>Node.right</code>&nbsp;的任何后代的值 <strong>严格大于</strong> <code>Node.val</code>。</p>\n\n<p>二叉树的 <strong>前序遍历</strong> 首先显示节点的值，然后遍历<code>Node.left</code>，最后遍历<code>Node.right</code>。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<p><img src=\"https://assets.leetcode.com/uploads/2019/03/06/1266.png\" /></p>\n\n<pre>\n<strong>输入：</strong>preorder = [8,5,1,7,10,12]\n<strong>输出：</strong>[8,5,10,1,7,null,12]\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong> preorder = [1,3]\n<strong>输出:</strong> [1,null,3]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= preorder.length &lt;= 100</code></li>\n\t<li><code>1 &lt;= preorder[i]&nbsp;&lt;= 10^8</code></li>\n\t<li><code>preorder</code> 中的值 <strong>互不相同</strong></li>\n</ul>\n\n<p>&nbsp;</p>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 203,
+            "likes": 212,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -167,7 +167,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"20.9K\", \"totalSubmission\": \"29K\", \"totalAcceptedRaw\": 20941, \"totalSubmissionRaw\": 29006, \"acRate\": \"72.2%\"}",
+            "stats": "{\"totalAccepted\": \"21.7K\", \"totalSubmission\": \"30.1K\", \"totalAcceptedRaw\": 21714, \"totalSubmissionRaw\": 30074, \"acRate\": \"72.2%\"}",
             "hints": [],
             "solution": null,
             "status": null,