update

leetcode-cn/originData/all-nodes-distance-k-in-binary-tree.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个二叉树（具有根结点&nbsp;<code>root</code>），&nbsp;一个目标结点&nbsp;<code>target</code>&nbsp;，和一个整数值 <code>k</code> 。</p>\n\n<p>返回到目标结点 <code>target</code> 距离为 <code>k</code> 的所有结点的值的列表。 答案可以以 <strong>任何顺序</strong> 返回。</p>\n\n<p>&nbsp;</p>\n\n<ol>\n</ol>\n\n<p><strong>示例 1：</strong></p>\n\n<p><img src=\"https://s3-lc-upload.s3.amazonaws.com/uploads/2018/06/28/sketch0.png\" style=\"height: 429px; width: 500px;\" /></p>\n\n<pre>\n<strong>输入：</strong>root = [3,5,1,6,2,0,8,null,null,7,4], target = 5, k = 2\n<strong>输出：</strong>[7,4,1]\n<strong>解释：</strong>所求结点为与目标结点（值为 5）距离为 2 的结点，值分别为 7，4，以及 1\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong> root = [1], target = 1, k = 3\n<strong>输出:</strong> []\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li>节点数在&nbsp;<code>[1, 500]</code>&nbsp;范围内</li>\n\t<li><code>0 &lt;= Node.val &lt;= 500</code></li>\n\t<li><code>Node.val</code>&nbsp;中所有值 <strong>不同</strong></li>\n\t<li>目标结点&nbsp;<code>target</code>&nbsp;是树上的结点。</li>\n\t<li><code>0 &lt;= k &lt;= 1000</code></li>\n</ul>\n\n<p>&nbsp;</p>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 510,
+            "likes": 525,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -137,7 +137,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"40.7K\", \"totalSubmission\": \"66.9K\", \"totalAcceptedRaw\": 40725, \"totalSubmissionRaw\": 66866, \"acRate\": \"60.9%\"}",
+            "stats": "{\"totalAccepted\": \"41.7K\", \"totalSubmission\": \"68.5K\", \"totalAcceptedRaw\": 41737, \"totalSubmissionRaw\": 68491, \"acRate\": \"60.9%\"}",
             "hints": [],
             "solution": null,
             "status": null,