update

leetcode-cn/originData/deepest-leaves-sum.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一棵二叉树的根节点 <code>root</code> ，请你返回 <strong>层数最深的叶子节点的和</strong> 。</p>\n\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n\n<p><strong><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/12/28/1483_ex1.png\" style=\"height: 265px; width: 273px;\" /></strong></p>\n\n<pre>\n<strong>输入：</strong>root = [1,2,3,4,5,null,6,7,null,null,null,null,8]\n<strong>输出：</strong>15\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5]\n<strong>输出：</strong>19\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li>树中节点数目在范围 <code>[1, 10<sup>4</sup>]</code> 之间。</li>\n\t<li><code>1 <= Node.val <= 100</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 75,
+            "likes": 77,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"22.9K\", \"totalSubmission\": \"27.8K\", \"totalAcceptedRaw\": 22888, \"totalSubmissionRaw\": 27810, \"acRate\": \"82.3%\"}",
+            "stats": "{\"totalAccepted\": \"23.6K\", \"totalSubmission\": \"28.6K\", \"totalAcceptedRaw\": 23601, \"totalSubmissionRaw\": 28647, \"acRate\": \"82.4%\"}",
             "hints": [
                 "Traverse the tree to find the max depth.",
                 "Traverse the tree again to compute the sum required."