update

leetcode-cn/originData/sum-of-left-leaves.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定二叉树的根节点&nbsp;<code>root</code>&nbsp;，返回所有左叶子之和。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<p><img src=\"https://assets.leetcode.com/uploads/2021/04/08/leftsum-tree.jpg\" /></p>\n\n<pre>\n<strong>输入:</strong> root = [3,9,20,null,null,15,7] \n<strong>输出:</strong> 24 \n<strong>解释:</strong> 在这个二叉树中，有两个左叶子，分别是 9 和 15，所以返回 24\n</pre>\n\n<p><strong>示例&nbsp;2:</strong></p>\n\n<pre>\n<strong>输入:</strong> root = [1]\n<strong>输出:</strong> 0\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li>节点数在&nbsp;<code>[1, 1000]</code>&nbsp;范围内</li>\n\t<li><code>-1000 &lt;= Node.val &lt;= 1000</code></li>\n</ul>\n\n<p>&nbsp;</p>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 418,
+            "likes": 438,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"136.7K\", \"totalSubmission\": \"227.9K\", \"totalAcceptedRaw\": 136689, \"totalSubmissionRaw\": 227928, \"acRate\": \"60.0%\"}",
+            "stats": "{\"totalAccepted\": \"145.5K\", \"totalSubmission\": \"241.1K\", \"totalAcceptedRaw\": 145487, \"totalSubmissionRaw\": 241067, \"acRate\": \"60.4%\"}",
             "hints": [],
             "solution": null,
             "status": null,