update

leetcode-cn/originData/maximum-depth-of-binary-tree.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个二叉树，找出其最大深度。</p>\n\n<p>二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。</p>\n\n<p><strong>说明:</strong>&nbsp;叶子节点是指没有子节点的节点。</p>\n\n<p><strong>示例：</strong><br>\n给定二叉树 <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",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 1171,
+            "likes": 1211,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Balanced Binary Tree\", \"titleSlug\": \"balanced-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u5e73\\u8861\\u4e8c\\u53c9\\u6811\"}, {\"title\": \"Minimum Depth of Binary Tree\", \"titleSlug\": \"minimum-depth-of-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u4e8c\\u53c9\\u6811\\u7684\\u6700\\u5c0f\\u6df1\\u5ea6\"}, {\"title\": \"Maximum Depth of N-ary Tree\", \"titleSlug\": \"maximum-depth-of-n-ary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": \"N \\u53c9\\u6811\\u7684\\u6700\\u5927\\u6df1\\u5ea6\"}]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"670.1K\", \"totalSubmission\": \"871K\", \"totalAcceptedRaw\": 670053, \"totalSubmissionRaw\": 870951, \"acRate\": \"76.9%\"}",
+            "stats": "{\"totalAccepted\": \"703.2K\", \"totalSubmission\": \"914.1K\", \"totalAcceptedRaw\": 703169, \"totalSubmissionRaw\": 914053, \"acRate\": \"76.9%\"}",
             "hints": [],
             "solution": {
                 "id": "87",