We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 9d3f79d commit 14052a9Copy full SHA for 14052a9
submatrix_sum.py
@@ -18,7 +18,7 @@ def submatrixSum(self, matrix):
18
[0, 8, 12, 20]
19
3. i2 >= i1, s[i2][k] - s[i1][k]的差等于m[i1][0]到m[i2 - 1][k - 1]的子矩阵的和。(闭区间)
20
以s[2][2] - s[1][2] = 16 - 6 = 10。m[1][0]到m[2][1]
21
- 4. 继续不在3,如果s[i2][j] - s[i1][j]等于s[i2][k] - s[i1][k],
+ 4. 继续步骤3,如果s[i2][j] - s[i1][j]等于s[i2][k] - s[i1][k],
22
那么说明m[i1][k]到m[i2 - 1][j - 1]的子矩阵和为0
23
'''
24
rows = len(matrix)
0 commit comments