update

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

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个二叉树，找出其最小深度。</p>\n\n<p>最小深度是从根节点到最近叶子节点的最短路径上的节点数量。</p>\n\n<p><strong>说明：</strong>叶子节点是指没有子节点的节点。</p>\n\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/10/12/ex_depth.jpg\" style=\"width: 432px; height: 302px;\" />\n<pre>\n<strong>输入：</strong>root = [3,9,20,null,null,15,7]\n<strong>输出：</strong>2\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>root = [2,null,3,null,4,null,5,null,6]\n<strong>输出：</strong>5\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li>树中节点数的范围在 <code>[0, 10<sup>5</sup>]</code> 内</li>\n\t<li><code>-1000 <= Node.val <= 1000</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 703,
+            "likes": 706,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Binary Tree Level Order Traversal\", \"titleSlug\": \"binary-tree-level-order-traversal\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u4e8c\\u53c9\\u6811\\u7684\\u5c42\\u5e8f\\u904d\\u5386\"}, {\"title\": \"Maximum Depth of Binary Tree\", \"titleSlug\": \"maximum-depth-of-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u4e8c\\u53c9\\u6811\\u7684\\u6700\\u5927\\u6df1\\u5ea6\"}]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"356.5K\", \"totalSubmission\": \"714.3K\", \"totalAcceptedRaw\": 356492, \"totalSubmissionRaw\": 714281, \"acRate\": \"49.9%\"}",
+            "stats": "{\"totalAccepted\": \"357.9K\", \"totalSubmission\": \"716.9K\", \"totalAcceptedRaw\": 357865, \"totalSubmissionRaw\": 716850, \"acRate\": \"49.9%\"}",
             "hints": [],
             "solution": null,
             "status": null,