LeetCode/Java/807.java at master · strengthen/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
__________________________________________________________________________________________________
sample 1 ms submission
class Solution {
    public int maxIncreaseKeepingSkyline(int[][] grid) {
        int[] maxPerRow = new int[grid.length];
        int[] maxPerCol = new int[grid[0].length];

        for (int r = 0; r < grid.length; r++) {
            for (int c = 0; c < grid[0].length; c++) {
                maxPerRow[r] = Math.max(maxPerRow[r], grid[r][c]);
                maxPerCol[c] = Math.max(maxPerCol[c], grid[r][c]);
            }
        }

        int ans = 0;
        for (int r = 0; r < grid.length; r++) {
            for (int c = 0; c < grid[0].length; c++) {
                ans += Math.min(maxPerRow[r], maxPerCol[c]) - grid[r][c];
            }
        }
        return ans;
    }
}
__________________________________________________________________________________________________
sample 37664 kb submission
class Solution {
    public int maxIncreaseKeepingSkyline(int[][] grid) {
        int oldSum = 0;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[0].length; j++) {
                oldSum += grid[i][j];
                int maxValueRow = 0, maxValueColumn = 0;
                for (int k = 0; k < grid[0].length; k++) {
                    if (grid[i][k] > maxValueRow) {
                        maxValueRow = grid[i][k];
                    }
                }

                for (int k = 0; k < grid.length; k++) {
                    if (grid[k][j] > maxValueColumn) {
                        maxValueColumn = grid[k][j];
                    }
                }

                grid[i][j] = Math.min(maxValueRow, maxValueColumn);
            }
        }

        int sum = 0;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[0].length; j++) {
                sum += grid[i][j];
            }
        }

        return sum - oldSum;
    }
}
__________________________________________________________________________________________________