update

leetcode-cn/originData/shu-de-zi-jie-gou-lcof.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>输入两棵二叉树A和B，判断B是不是A的子结构。(约定空树不是任意一个树的子结构)</p>\n\n<p>B是A的子结构， 即 A中有出现和B相同的结构和节点值。</p>\n\n<p>例如:<br>\n给定的树 A:</p>\n\n<p><code>&nbsp; &nbsp; &nbsp;3<br>\n&nbsp; &nbsp; / \\<br>\n&nbsp; &nbsp;4 &nbsp; 5<br>\n&nbsp; / \\<br>\n&nbsp;1 &nbsp; 2</code><br>\n给定的树 B：</p>\n\n<p><code>&nbsp; &nbsp;4&nbsp;<br>\n&nbsp; /<br>\n&nbsp;1</code><br>\n返回 true，因为 B 与 A 的一个子树拥有相同的结构和节点值。</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre><strong>输入：</strong>A = [1,2,3], B = [3,1]\n<strong>输出：</strong>false\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre><strong>输入：</strong>A = [3,4,5,1,2], B = [4,1]\n<strong>输出：</strong>true</pre>\n\n<p><strong>限制：</strong></p>\n\n<p><code>0 &lt;= 节点个数 &lt;= 10000</code></p>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 517,
+            "likes": 518,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"203.2K\", \"totalSubmission\": \"434.8K\", \"totalAcceptedRaw\": 203224, \"totalSubmissionRaw\": 434835, \"acRate\": \"46.7%\"}",
+            "stats": "{\"totalAccepted\": \"204.2K\", \"totalSubmission\": \"436.8K\", \"totalAcceptedRaw\": 204182, \"totalSubmissionRaw\": 436828, \"acRate\": \"46.7%\"}",
             "hints": [],
             "solution": null,
             "status": null,