update

leetcode-cn/originData/same-tree.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你两棵二叉树的根节点 <code>p</code> 和 <code>q</code> ，编写一个函数来检验这两棵树是否相同。</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/2020/12/20/ex1.jpg\" style=\"width: 622px; height: 182px;\" />\n<pre>\n<strong>输入：</strong>p = [1,2,3], q = [1,2,3]\n<strong>输出：</strong>true\n</pre>\n\n<p><strong>示例 2：</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/12/20/ex2.jpg\" style=\"width: 382px; height: 182px;\" />\n<pre>\n<strong>输入：</strong>p = [1,2], q = [1,null,2]\n<strong>输出：</strong>false\n</pre>\n\n<p><strong>示例 3：</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/12/20/ex3.jpg\" style=\"width: 622px; height: 182px;\" />\n<pre>\n<strong>输入：</strong>p = [1,2,1], q = [1,1,2]\n<strong>输出：</strong>false\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li>两棵树上的节点数目都在范围 <code>[0, 100]</code> 内</li>\n\t<li><code>-10<sup>4</sup> <= Node.val <= 10<sup>4</sup></code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 790,
+            "likes": 792,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"314.8K\", \"totalSubmission\": \"526.5K\", \"totalAcceptedRaw\": 314791, \"totalSubmissionRaw\": 526547, \"acRate\": \"59.8%\"}",
+            "stats": "{\"totalAccepted\": \"315.8K\", \"totalSubmission\": \"528.2K\", \"totalAcceptedRaw\": 315803, \"totalSubmissionRaw\": 528205, \"acRate\": \"59.8%\"}",
             "hints": [],
             "solution": null,
             "status": null,