update

leetcode-cn/originData/max-submatrix-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个正整数、负整数和 0 组成的 N &times; M&nbsp;矩阵，编写代码找出元素总和最大的子矩阵。</p>\n\n<p>返回一个数组 <code>[r1, c1, r2, c2]</code>，其中 <code>r1</code>, <code>c1</code> 分别代表子矩阵左上角的行号和列号，<code>r2</code>, <code>c2</code> 分别代表右下角的行号和列号。若有多个满足条件的子矩阵，返回任意一个均可。</p>\n\n<p><strong>注意：</strong>本题相对书上原题稍作改动</p>\n\n<p><strong>示例：</strong></p>\n\n<pre><strong>输入：\n</strong><code>[\n&nbsp;  [-1,<strong>0</strong>],\n&nbsp;  [0,-1]\n]</code>\n<strong>输出：</strong>[0,1,0,1]\n<strong>解释：</strong>输入中标粗的元素即为输出所表示的矩阵</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>说明：</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= matrix.length, matrix[0].length &lt;= 200</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 133,
+            "likes": 139,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"14.8K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 14775, \"totalSubmissionRaw\": 27863, \"acRate\": \"53.0%\"}",
+            "stats": "{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 15650, \"totalSubmissionRaw\": 29414, \"acRate\": \"53.2%\"}",
             "hints": [
                 "从蛮力解法开始。",
                 "蛮力解法要求连续计算每个矩阵的和。能优化它吗？",