-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
892.java
65 lines (58 loc) · 1.97 KB
/
892.java
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
60
61
62
63
64
65
__________________________________________________________________________________________________
sample 1 ms submission
class Solution {
int N;
int[] dx = new int[]{-1, 0, 0, 1};
int[] dy = new int[]{0, -1, 1, 0};
public int surfaceArea(int[][] grid) {
N = grid.length;
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
ans += area(grid, i, j);
}
}
return ans;
}
private int area(int[][] grid, int x, int y) {
int cur = grid[x][y];
if (cur == 0) {
return 0;
}
int res = 2;
for (int i = 0; i < 4; i++) {
int nx = x + dx[i], ny = y + dy[i];
if (inBound(nx, ny)) {
res += cur - grid[nx][ny] > 0 ? cur - grid[nx][ny] : 0;
} else {
res += cur;
}
}
return res;
}
private boolean inBound(int x, int y) {
return x >= 0 && x < N && y >= 0 && y < N;
}
}
__________________________________________________________________________________________________
sample 38472 kb submission
class Solution {
int [] dr = new int [] {1, 0, -1, 0};
int [] dc = new int [] {0, 1, 0, -1};
public int surfaceArea(int[][] grid) {
int res = 0;
for(int i = 0; i < grid.length; ++i) for(int j = 0; j < grid[0].length; ++j) res += getArea(grid, i, j);
return res;
}
private int getArea(int[][]grid, int r, int c){
if(grid[r][c] == 0) return 0;
int area = grid[r][c] * 4 + 2;
for(int i = 0; i < dr.length; ++i){
int nR = r + dr[i], nC = c + dc[i];
if(nR < 0 || nC < 0 || nR >= grid.length || nC >= grid[0].length) continue;
area -= Math.min(grid[r][c], grid[nR][nC]);
}
return area;
}
}
__________________________________________________________________________________________________