update

leetcode-cn/originData/ping-heng-er-cha-shu-lcof.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>输入一棵二叉树的根节点，判断该树是不是平衡二叉树。如果某二叉树中任意节点的左右子树的深度相差不超过1，那么它就是一棵平衡二叉树。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<p>给定二叉树 <code>[3,9,20,null,null,15,7]</code></p>\n\n<pre>\n    3\n   / \\\n  9  20\n    /  \\\n   15   7</pre>\n\n<p>返回 <code>true</code> 。<br />\n<br />\n<strong>示例 2:</strong></p>\n\n<p>给定二叉树 <code>[1,2,2,3,3,null,null,4,4]</code></p>\n\n<pre>\n       1\n      / \\\n     2   2\n    / \\\n   3   3\n  / \\\n 4   4\n</pre>\n\n<p>返回 <code>false</code> 。</p>\n\n<p> </p>\n\n<p><strong>限制：</strong></p>\n\n<ul>\n\t<li><code>0 <= 树的结点个数 <= 10000</code></li>\n</ul>\n\n<p>注意：本题与主站 110 题相同：<a href=\"https://leetcode-cn.com/problems/balanced-binary-tree/\">https://leetcode-cn.com/problems/balanced-binary-tree/</a></p>\n\n<p> </p>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 249,
+            "likes": 269,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"178.1K\", \"totalSubmission\": \"300K\", \"totalAcceptedRaw\": 178074, \"totalSubmissionRaw\": 299958, \"acRate\": \"59.4%\"}",
+            "stats": "{\"totalAccepted\": \"186.6K\", \"totalSubmission\": \"314K\", \"totalAcceptedRaw\": 186626, \"totalSubmissionRaw\": 313995, \"acRate\": \"59.4%\"}",
             "hints": [],
             "solution": null,
             "status": null,