当前位置：网站首页>Leetcode: interview question 17.24 Maximum cumulative sum of submatrix (to be studied)

Leetcode: interview question 17.24 Maximum cumulative sum of submatrix (to be studied)

2022-07-06 22:29:00 【Oceanstar's study notes】

Insert picture description here

Analyze the amount of data

1 <= matrix.length, matrix[0].length <= 200： $10^8 / 10^2 = 10^6,(10^2)^3 = 10^6$ , So the maximum time complexity of the algorithm is $O(N^3)$ , It can be used dp To do it

版权声明
本文为[Oceanstar's study notes]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/187/202207061446487713.html