leet807. Max Increase to Keep City Skyline

题目：

In a 2 dimensional array grid, each value grid[i][j] represents the height of a building located there. We are allowed to increase the height of any number of buildings, by any amount (the amounts can be different for different buildings). Height 0 is considered to be a building as well. 

At the end, the "skyline" when viewed from all four directions of the grid, i.e. top, bottom, left, and right, must be the same as the skyline of the original grid. A city's skyline is the outer contour of the rectangles formed by all the buildings when viewed from a distance. See the following example.

What is the maximum total sum that the height of the buildings can be increased?

分析：

1. 每个元素有两个地平线约束，最大只能取两个约束的最小值
2. 计算各行各列的地平线值
3. 计算每个位置最大取值与当前值差值，累加
   

代码：

class Solution(object):
    def maxIncreaseKeepingSkyline(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        lrGrid = zip(*grid)
        lrMax = map(max,lrGrid)
        tbMax = map(max,grid)
        sumChange = 0
        for i in xrange(len(grid)):
            for j in xrange(len(lrGrid)):
                sumChange += (min(lrMax[i],tbMax[j]) - grid[i][j])
        return sumChange

思考：