807. Max Increase to Keep City Skyline

leetcode.com/problems/max-increase-to-keep-city-skyline/

Max Increase to Keep City Skyline - LeetCode

class Solution(object):
    def maxIncreaseKeepingSkyline(self, grid):

        v_max = []
        for i in range(0, len(grid)):
            v_max.append(max(grid[i]))

        s_max = []
        for i in range(0, len(grid)):
            temp = -1
            for j in range(0, len(grid)):
                if grid[j][i] > temp:
                    temp = grid[j][i]
            s_max.append(temp)

        new_grid = []
        for i in range(0, len(grid)):
            temp = []
            for j in range(0, len(grid)):
                temp.append(min(v_max[i], s_max[j]))
            new_grid.append(temp)

        sum = 0
        for i in range(0, len(grid)):
            for j in range(0, len(grid)):
                sum += new_grid[i][j] - grid[i][j]
        return sum

leetcode.com/problems/max-increase-to-keep-city-skyline/discuss/304990/Python-solution-Easy-fast-with-comments

leetcode.com/problems/max-increase-to-keep-city-skyline/discuss/445773/Python-3-(two-lines)-(beats-~100)