update

leetcode-cn/originData/all-possible-full-binary-trees.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p><em>满二叉树</em>是一类二叉树，其中每个结点恰好有 0 或 2 个子结点。</p>\n\n<p>返回包含 <code>N</code> 个结点的所有可能满二叉树的列表。 答案的每个元素都是一个可能树的根结点。</p>\n\n<p>答案中每个树的每个<code>结点</code>都<strong>必须</strong>有 <code>node.val=0</code>。</p>\n\n<p>你可以按任何顺序返回树的最终列表。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例：</strong></p>\n\n<pre><strong>输入：</strong>7\n<strong>输出：</strong>[[0,0,0,null,null,0,0,null,null,0,0],[0,0,0,null,null,0,0,0,0],[0,0,0,0,0,0,0],[0,0,0,0,0,null,null,null,null,0,0],[0,0,0,0,0,null,null,0,0]]\n<strong>解释：</strong>\n<img alt=\"\" src=\"https://aliyun-lc-upload.oss-cn-hangzhou.aliyuncs.com/aliyun-lc-upload/uploads/2018/08/24/fivetrees.png\" style=\"height: 400px; width: 700px;\">\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= N &lt;= 20</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 253,
+            "likes": 255,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -161,7 +161,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"19.4K\", \"totalAcceptedRaw\": 15050, \"totalSubmissionRaw\": 19372, \"acRate\": \"77.7%\"}",
+            "stats": "{\"totalAccepted\": \"15.4K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 15388, \"totalSubmissionRaw\": 19786, \"acRate\": \"77.8%\"}",
             "hints": [],
             "solution": {
                 "id": "86",