update

leetcode-cn/originData/dui-cheng-de-er-cha-shu-lcof.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>请实现一个函数，用来判断一棵二叉树是不是对称的。如果一棵二叉树和它的镜像一样，那么它是对称的。</p>\n\n<p>例如，二叉树&nbsp;[1,2,2,3,4,4,3] 是对称的。</p>\n\n<p><code>&nbsp; &nbsp; 1<br>\n&nbsp; &nbsp;/ \\<br>\n&nbsp; 2 &nbsp; 2<br>\n&nbsp;/ \\ / \\<br>\n3 &nbsp;4 4 &nbsp;3</code><br>\n但是下面这个&nbsp;[1,2,2,null,3,null,3] 则不是镜像对称的:</p>\n\n<p><code>&nbsp; &nbsp; 1<br>\n&nbsp; &nbsp;/ \\<br>\n&nbsp; 2 &nbsp; 2<br>\n&nbsp; &nbsp;\\ &nbsp; \\<br>\n&nbsp; &nbsp;3 &nbsp; &nbsp;3</code></p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre><strong>输入：</strong>root = [1,2,2,3,4,4,3]\n<strong>输出：</strong>true\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre><strong>输入：</strong>root = [1,2,2,null,3,null,3]\n<strong>输出：</strong>false</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>限制：</strong></p>\n\n<p><code>0 &lt;= 节点个数 &lt;= 1000</code></p>\n\n<p>注意：本题与主站 101 题相同：<a href=\"https://leetcode-cn.com/problems/symmetric-tree/\">https://leetcode-cn.com/problems/symmetric-tree/</a></p>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 317,
+            "likes": 334,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"203.2K\", \"totalSubmission\": \"352K\", \"totalAcceptedRaw\": 203159, \"totalSubmissionRaw\": 352032, \"acRate\": \"57.7%\"}",
+            "stats": "{\"totalAccepted\": \"212.7K\", \"totalSubmission\": \"368.8K\", \"totalAcceptedRaw\": 212688, \"totalSubmissionRaw\": 368839, \"acRate\": \"57.7%\"}",
             "hints": [],
             "solution": null,
             "status": null,