update

leetcode-cn/originData/er-cha-shu-de-shen-du-lcof.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>输入一棵二叉树的根节点，求该树的深度。从根节点到叶节点依次经过的节点（含根、叶节点）形成树的一条路径，最长路径的长度为树的深度。</p>\n\n<p>例如：</p>\n\n<p>给定二叉树 <code>[3,9,20,null,null,15,7]</code>，</p>\n\n<pre>    3\n   / \\\n  9  20\n    /  \\\n   15   7</pre>\n\n<p>返回它的最大深度&nbsp;3 。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ol>\n\t<li><code>节点总数 &lt;= 10000</code></li>\n</ol>\n\n<p>注意：本题与主站 104&nbsp;题相同：<a href=\"https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/\">https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/</a></p>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 176,
+            "likes": 186,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"223.6K\", \"totalSubmission\": \"282.5K\", \"totalAcceptedRaw\": 223553, \"totalSubmissionRaw\": 282487, \"acRate\": \"79.1%\"}",
+            "stats": "{\"totalAccepted\": \"232.8K\", \"totalSubmission\": \"294.1K\", \"totalAcceptedRaw\": 232794, \"totalSubmissionRaw\": 294083, \"acRate\": \"79.2%\"}",
             "hints": [],
             "solution": null,
             "status": null,