Max Increase to Keep City Skyline LeetCode solution in Python

1
class Solution:
2
    def maxIncreaseKeepingSkyline(self, grid: List[List[int]]) -> int:
3
        mxr = [max(i) for i in grid]
4
        mxc = [0 for _ in range(len(grid[0]))]
5
        for i in range(len(grid)):
6
            for j in range(len(grid[0])):
7
                mxc[j] = max(grid[i][j], mxc[j])
8
        ans = 0
9
        for i in range(len(grid)):
10
            for j in range(len(grid)):
11
                ans += min(mxr[i], mxc[j]) - grid[i][j]
12
        return ans