update

leetcode/originData/[no content]minimum-operations-to-remove-adjacent-ones-in-matrix.json

@@ -11,7 +11,7 @@
             "translatedContent": null,
             "isPaidOnly": true,
             "difficulty": "Hard",
-            "likes": 22,
+            "likes": 24,
             "dislikes": 4,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Set Matrix Zeroes\", \"titleSlug\": \"set-matrix-zeroes\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"01 Matrix\", \"titleSlug\": \"01-matrix\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix\", \"titleSlug\": \"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Remove All Ones With Row and Column Flips\", \"titleSlug\": \"remove-all-ones-with-row-and-column-flips\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -40,7 +40,7 @@
             ],
             "companyTagStats": null,
             "codeSnippets": null,
-            "stats": "{\"totalAccepted\": \"406\", \"totalSubmission\": \"984\", \"totalAcceptedRaw\": 406, \"totalSubmissionRaw\": 984, \"acRate\": \"41.3%\"}",
+            "stats": "{\"totalAccepted\": \"411\", \"totalSubmission\": \"992\", \"totalAcceptedRaw\": 411, \"totalSubmissionRaw\": 992, \"acRate\": \"41.4%\"}",
             "hints": [
                 "Consider each cell containing a 1 as a vertex whose neighbors are the cells 4-directionally connected to it. The grid then becomes a bipartite graph.",
                 "You want to find the smallest set of vertices such that every edge in the graph has an endpoint in this set. If you remove every vertex in this set from the graph, then all the 1’s will be disconnected. Are there any well-known algorithms for finding this set?",