update

leetcode-cn/originData/binary-tree-paths.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个二叉树的根节点 <code>root</code> ，按 <strong>任意顺序</strong> ，返回所有从根节点到叶子节点的路径。</p>\n\n<p><strong>叶子节点</strong> 是指没有子节点的节点。</p>\n&nbsp;\n\n<p><strong>示例 1：</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/03/12/paths-tree.jpg\" style=\"width: 207px; height: 293px;\" />\n<pre>\n<strong>输入：</strong>root = [1,2,3,null,5]\n<strong>输出：</strong>[\"1-&gt;2-&gt;5\",\"1-&gt;3\"]\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>root = [1]\n<strong>输出：</strong>[\"1\"]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li>树中节点的数目在范围 <code>[1, 100]</code> 内</li>\n\t<li><code>-100 &lt;= Node.val &lt;= 100</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 688,
+            "likes": 690,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Path Sum II\", \"titleSlug\": \"path-sum-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u8def\\u5f84\\u603b\\u548c II\"}, {\"title\": \"Smallest String Starting From Leaf\", \"titleSlug\": \"smallest-string-starting-from-leaf\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u4ece\\u53f6\\u7ed3\\u70b9\\u5f00\\u59cb\\u7684\\u6700\\u5c0f\\u5b57\\u7b26\\u4e32\"}]",
@@ -161,7 +161,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"187.7K\", \"totalSubmission\": \"271K\", \"totalAcceptedRaw\": 187735, \"totalSubmissionRaw\": 271027, \"acRate\": \"69.3%\"}",
+            "stats": "{\"totalAccepted\": \"188.5K\", \"totalSubmission\": \"272.1K\", \"totalAcceptedRaw\": 188536, \"totalSubmissionRaw\": 272127, \"acRate\": \"69.3%\"}",
             "hints": [],
             "solution": null,
             "status": null,