- 题目描述
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, given the following triangle
[
[2],
[3,4],
[6,5,7],
[4,1,8,3]
]
The minimum path sum from top to bottom is11(i.e., 2 + 3 + 5 + 1 = 11).
Note:
Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.
三角矩阵:给定一个三角矩阵,找出自顶向下的最短路径和,每一步可以移动到下一行的相邻数字。比如给定下面一个三角矩阵,自顶向下的最短路径和为11。
- 解析
状态:F( i , j ):从(0,0)到(i,j)的最短路径
从(0,0)到(1,0)(1,1)(2,0)…(n,n)的最短路径和
状态递归: F(i , j) = min(F(i-1 , j), F(i-1 , j-1 ))+a[i][j]
点(i,j)可以移动到(i+1 , j)和(i+1 , j+1)
点(i-1,j)和点(i-1,j-1)可以走到点(i,j)
边上的点:最边上的点只能由上一行最边上的点到达
每一行的第一列:F(i,0) = F(i-1,0)+a[i][0]
每一行的最后一列:F(i,i) = F(i-1,i-1)+a[i][i]
初始状态:F(0,0) = a[0][0]
返回结果:min(F(row-1 , j))最后一行的最小值
给一个ArrayList<ArrayList<Integer>> triangle集合存放矩阵
代码:
import java.util.*;
public class Solution {
public int minimumTotal(ArrayList<ArrayList<Integer>> triangle) {
int[][] dp = new int[triangle.size()][triangle.size()];
//初始化
dp[0][0] = triangle.get(0).get(0);
//边上的点
for(int i = 1; i < dp.length; i++){
dp[i][0] = dp[i-1][0]+triangle.get(i).get(0);
//F(i,i) = F(i-1,i-1)+a[i][i]
dp[i][i] = dp[i-1][i-1]+triangle.get(i).get(i);
}
//中间的点,从第三行开始
for(int i = 2; i < dp.length; i++){
for(int j = 1; j < i; j++){
dp[i][j] = Math.min(dp[i-1][j],dp[i-1][j-1])+triangle.get(i).get(j);
}
}
//最后一行选一个最小值
int min = dp[dp.length-1][0];
for(int j = 1; j < dp.length; j++){
min = Math.min(dp[dp.length-1][j],min);
}
return min;
}
}