Amazon | OA 2019 | Max Of Min Altitudes

Posted on | Edited on | Views:

link


DP

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
// import java.util.*;
class Solution {
    static int maxScore(int[][] grid) {
        int R=grid.length,C=grid[0].length;
        if ( R== 0 || C == 0) return 0;
        for (int i = 1; i < R; i++) {
            for (int j = 1; j < C; j++) {
                if(i == 0 && j == 0 || i == 0 && j == 1 || i == 1 && j == 0) continue;
                else if(i==0) grid[i][j] = Math.min(grid[i][j], grid[i][j - 1]);
                else if(j==0) grid[i][j] = Math.min(grid[i][j], grid[i-1][j]);
                else if(i == R - 1 && j == C - 1) grid[i][j] = Math.max(grid[i-1][j],grid[i][j-1]);
                else grid[i][j] = Math.max(Math.min(grid[i - 1][j], grid[i][j]), Math.min(grid[i][j - 1], grid[i][j]));
            }
        }
        return grid[R - 1][C-1];
    }
}
/*
public class MyClass {
    public static void main(String[] args) {
        int[][] grid={{1, 2, 3},{4, 5, 1}};
        System.out.println(Solution.maxScore(grid));
    }
}*/

/*
class Solution {
    static int maxScore(int[][] grid) {
        int R=grid.length,C=grid[0].length;
        if ( R== 0 || C == 0) return 0;

        for (int i = 2; i < C; i++) {
            grid[0][i] = Math.min(grid[0][i], grid[0][i - 1]);
        }
        for (int i = 2; i < R; i++) {
            grid[i][0] = Math.min(grid[i][0], grid[i - 1][0]);
        }

        for (int i = 1; i < R; i++) {
            for (int j = 1; j < C; j++) {
                grid[i][j] = Math.max(Math.min(grid[i - 1][j], grid[i][j]), Math.min(grid[i][j - 1], grid[i][j]));
            }
        }
        return Math.max(grid[R - 2][C - 1],grid[R-1][C-2]);
    }
}*/

0%