update

leetcode-cn/originData/zero-matrix-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>编写一种算法，若M × N矩阵中某个元素为0，则将其所在的行与列清零。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre><strong>输入：</strong>\n[\n  [1,1,1],\n  [1,0,1],\n  [1,1,1]\n]\n<strong>输出：</strong>\n[\n  [1,0,1],\n  [0,0,0],\n  [1,0,1]\n]\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre><strong>输入：</strong>\n[\n  [0,1,2,0],\n  [3,4,5,2],\n  [1,3,1,5]\n]\n<strong>输出：</strong>\n[\n  [0,0,0,0],\n  [0,4,5,0],\n  [0,3,1,0]\n]\n</pre>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 54,
+            "likes": 61,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -131,7 +131,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"57K\", \"totalSubmission\": \"91.6K\", \"totalAcceptedRaw\": 56964, \"totalSubmissionRaw\": 91589, \"acRate\": \"62.2%\"}",
+            "stats": "{\"totalAccepted\": \"59.5K\", \"totalSubmission\": \"95.7K\", \"totalAcceptedRaw\": 59451, \"totalSubmissionRaw\": 95685, \"acRate\": \"62.1%\"}",
             "hints": [
                 "如果你在找到0时清除了行和列，则可能会清理整个矩阵。在对矩阵进行任何更改之前，首先尝试找到所有的0。",
                 "你能只用额外的O(N)空间而不是O(N2)吗？在为0的单元格列表中你真正需要的是什么信息？",