class Solution {
public int minimumTotal(List<List<Integer>> triangle) {
int m=triangle.size();
int[][] arr=new int[m][m];
for (int i = 0; i < m; i++) {
for(int j = 0;j < i+1;j++){
arr[i][j]=triangle.get(i).get(j);
}
}
for(int i = 1;i < arr.length;i++) {
for(int j = 0; j < i+1;j++) {
if(j==0) {
arr[i][j] = arr[i-1][j] + arr[i][j];continue;
}if(j==i) {
arr[i][j] = arr[i-1][j-1] + arr[i][j];continue;
}if(j>0){
arr[i][j] = Math.min(arr[i-1][j] , arr[i-1][j-1]) + arr[i][j];
}
}
}
Arrays.sort(arr[arr.length-1]);
return arr[arr.length-1][0];
}
}
05-09
913
09-22
223