题目:原题链接(中等)
标签:动态规划、数组
解法 | 时间复杂度 | 空间复杂度 | 执行用时 |
---|---|---|---|
Ans 1 (Python) | O ( M 2 × N ) O(M^2×N) O(M2×N) | O ( 1 ) O(1) O(1) | 3056ms (8.70%) |
Ans 2 (Python) | |||
Ans 3 (Python) |
解法一(暴力解法):
class Solution:
def countCornerRectangles(self, grid: List[List[int]]) -> int:
m, n = len(grid), len(grid[0])
ans = 0
for i1 in range(m):
for i2 in range(i1 + 1, m):
count = 0
for j in range(n):
if grid[i1][j] == 1 and grid[i2][j] == 1:
count += 1
ans += (1 + count - 1) * (count - 1) // 2
return ans