update

leetcode-cn/originData/list-of-depth-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一棵二叉树，设计一个算法，创建含有某一深度上所有节点的链表（比如，若一棵树的深度为 <code>D</code>，则会创建出 <code>D</code> 个链表）。返回一个包含所有深度的链表的数组。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例：</strong></p>\n\n<pre><strong>输入：</strong>[1,2,3,4,5,null,7,8]\n\n        1\n       /  \\ \n      2    3\n     / \\    \\ \n    4   5    7\n   /\n  8\n\n<strong>输出：</strong>[[1],[2,3],[4,5,7],[8]]\n</pre>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 68,
+            "likes": 71,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"28K\", \"totalSubmission\": \"34.8K\", \"totalAcceptedRaw\": 28013, \"totalSubmissionRaw\": 34815, \"acRate\": \"80.5%\"}",
+            "stats": "{\"totalAccepted\": \"28.7K\", \"totalSubmission\": \"35.7K\", \"totalAcceptedRaw\": 28708, \"totalSubmissionRaw\": 35698, \"acRate\": \"80.4%\"}",
             "hints": [
                 "尝试修改图形搜索算法，从根开始追踪深度。",
                 "从层号映射到该层节点的散列表或数组也许有些用处。",