update

leetcode-cn/originData/shortest-bridge.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>在给定的二维二进制数组 <code>A</code> 中，存在两座岛。（岛是由四面相连的 <code>1</code> 形成的一个最大组。）</p>\n\n<p>现在，我们可以将 <code>0</code> 变为 <code>1</code>，以使两座岛连接起来，变成一座岛。</p>\n\n<p>返回必须翻转的 <code>0</code> 的最小数目。（可以保证答案至少是 <code>1</code> 。）</p>\n\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>A = [[0,1],[1,0]]\n<strong>输出：</strong>1\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>A = [[0,1,0],[0,0,0],[0,0,1]]\n<strong>输出：</strong>2\n</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<pre>\n<strong>输入：</strong>A = [[1,1,1,1,1],[1,0,0,0,1],[1,0,1,0,1],[1,0,0,0,1],[1,1,1,1,1]]\n<strong>输出：</strong>1</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>2 <= A.length == A[0].length <= 100</code></li>\n\t<li><code>A[i][j] == 0</code> 或 <code>A[i][j] == 1</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 237,
+            "likes": 242,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"30.2K\", \"totalSubmission\": \"63.4K\", \"totalAcceptedRaw\": 30152, \"totalSubmissionRaw\": 63390, \"acRate\": \"47.6%\"}",
+            "stats": "{\"totalAccepted\": \"31.6K\", \"totalSubmission\": \"66.4K\", \"totalAcceptedRaw\": 31615, \"totalSubmissionRaw\": 66366, \"acRate\": \"47.6%\"}",
             "hints": [],
             "solution": null,
             "status": null,