update

leetcode-cn/originData/find-largest-value-in-each-tree-row.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一棵二叉树的根节点&nbsp;<code>root</code> ，请找出该二叉树中每一层的最大值。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例1：</strong></p>\n\n<p><img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg\" style=\"height: 172px; width: 300px;\" /></p>\n\n<pre>\n<strong>输入: </strong>root = [1,3,2,5,3,null,9]\n<strong>输出: </strong>[1,3,9]\n</pre>\n\n<p><strong>示例2：</strong></p>\n\n<pre>\n<strong>输入: </strong>root = [1,2,3]\n<strong>输出: </strong>[1,3]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li>二叉树的节点个数的范围是 <code>[0,10<sup>4</sup>]</code></li>\n\t<li><meta charset=\"UTF-8\" /><code>-2<sup>31</sup>&nbsp;&lt;= Node.val &lt;= 2<sup>31</sup>&nbsp;- 1</code></li>\n</ul>\n\n<p>&nbsp;</p>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 177,
+            "likes": 185,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"55.6K\", \"totalSubmission\": \"85K\", \"totalAcceptedRaw\": 55577, \"totalSubmissionRaw\": 85033, \"acRate\": \"65.4%\"}",
+            "stats": "{\"totalAccepted\": \"59.4K\", \"totalSubmission\": \"90.7K\", \"totalAcceptedRaw\": 59413, \"totalSubmissionRaw\": 90664, \"acRate\": \"65.5%\"}",
             "hints": [],
             "solution": null,
             "status": null,