solve problem Max Increase To Keep City Skyline

Author: P-ppc

README.md

@@ -259,6 +259,7 @@ All solutions will be accepted!
 |11|[Container With Most Water](https://leetcode-cn.com/problems/container-with-most-water/description/)|[java/py/js](./algorithms/ContainerWithMostWater)|Medium|
 |338|[Counting Bits](https://leetcode-cn.com/problems/counting-bits/description/)|[java/py/js](./algorithms/CountingBits)|Medium|
 |287|[Find The Duplicate Number](https://leetcode-cn.com/problems/find-the-duplicate-number/description/)|[java/py/js](./algorithms/FindTheDuplicateNumber)|Medium|
+|807|[Max Increase To Keep City Skyline](https://leetcode-cn.com/problems/max-increase-to-keep-city-skyline/description/)|[java/py/js](./algorithms/MaxIncreaseToKeepCitySkyline)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/MaxIncreaseToKeepCitySkyline/README.md

@@ -0,0 +1,2 @@
+# Max Increase To Keep City Skyline
+This problem is easy to solve

algorithms/MaxIncreaseToKeepCitySkyline/Solution.java

@@ -0,0 +1,27 @@
+class Solution {
+    public int maxIncreaseKeepingSkyline(int[][] grid) {
+        int length = grid.length,
+            count = 0;
+        
+        int[] topSkyline = new int[length],
+              leftSkyline = new int[length];
+        
+        for (int i = 0; i < length; i++) {
+            int skyline = 0;
+            for (int j = 0; j < length; j++)
+                skyline = Math.max(skyline, grid[i][j]);
+            leftSkyline[i] = skyline;
+            
+            skyline = 0;
+            for (int j = 0; j < length; j++)
+                skyline = Math.max(skyline, grid[j][i]);
+            topSkyline[i] = skyline;
+        }
+        
+        for (int i = 0; i < length; i++)
+            for (int j = 0; j < length; j++)
+                count += Math.min(leftSkyline[i], topSkyline[j]) - grid[i][j];
+        
+        return count;
+    }
+}

algorithms/MaxIncreaseToKeepCitySkyline/solution.js

@@ -0,0 +1,26 @@
+/**
+ * @param {number[][]} grid
+ * @return {number}
+ */
+var maxIncreaseKeepingSkyline = function(grid) {
+    let length = grid.length,
+        topSkyline = [],
+        leftSkyline = [],
+        count = 0
+    
+    for (let i = 0; i < length; i++) {
+        leftSkyline.push(Math.max(...grid[i]))
+        
+        let skyline = 0
+        for (let j = 0; j < length; j++)
+            skyline = Math.max(skyline, grid[j][i])
+        topSkyline.push(skyline)        
+    }
+    
+    for (let i = 0; i < length; i++) {
+        for (let j = 0; j < length; j++)
+            count += Math.min(leftSkyline[i], topSkyline[j]) - grid[i][j]
+    }
+    
+    return count
+};

algorithms/MaxIncreaseToKeepCitySkyline/solution.py

@@ -0,0 +1,25 @@
+class Solution(object):
+    def maxIncreaseKeepingSkyline(self, grid):
+        """
+        :type grid: List[List[int]]
+        :rtype: int
+        """
+        length = len(grid)
+        
+        top_skyline = []
+        left_skyline = []
+        
+        for i in xrange(length):
+            left_skyline.append(max(grid[i]))
+            
+            skyline = 0
+            for j in xrange(length):
+                skyline = max(skyline, grid[j][i])
+            top_skyline.append(skyline)
+        
+        count = 0
+        for i in xrange(length):
+            for j in xrange(length):
+                count += min(left_skyline[i], top_skyline[j]) - grid[i][j]
+                
+        return count