update

leetcode-cn/originData/pond-sizes-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>你有一个用于表示一片土地的整数矩阵<code>land</code>，该矩阵中每个点的值代表对应地点的海拔高度。若值为0则表示水域。由垂直、水平或对角连接的水域为池塘。池塘的大小是指相连接的水域的个数。编写一个方法来计算矩阵中所有池塘的大小，返回值需要从小到大排序。</p>\n<p><strong>示例：</strong></p>\n<pre><strong>输入：</strong>\n[\n  [0,2,1,0],\n  [0,1,0,1],\n  [1,1,0,1],\n  [0,1,0,1]\n]\n<strong>输出：</strong> [1,2,4]\n</pre>\n<p><strong>提示：</strong></p>\n<ul>\n<li><code>0 < len(land) <= 1000</code></li>\n<li><code>0 < len(land[i]) <= 1000</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 79,
+            "likes": 82,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -161,7 +161,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"22.7K\", \"totalSubmission\": \"36.7K\", \"totalAcceptedRaw\": 22741, \"totalSubmissionRaw\": 36717, \"acRate\": \"61.9%\"}",
+            "stats": "{\"totalAccepted\": \"23.2K\", \"totalSubmission\": \"37.4K\", \"totalAcceptedRaw\": 23214, \"totalSubmissionRaw\": 37414, \"acRate\": \"62.0%\"}",
             "hints": [
                 "如果给你一个指代水的单元格的行和列，你如何找到所有相邻的水域？",
                 "尝试递归计算含水单元格的数目。",