1. 使用最小花费爬楼梯(leetcode746)
(1)确定dp[i]含义 到达i位置所需要的花费为dp[i]
(2)递推公式: dp[i]=min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2])
(3)dp数组如何初始化: dp[0]=0 dp[1]=0
(4)遍历顺序: 从前向后遍历
(5)打印dp数组
public static void main(String[] args) { int[] array1 = new int[] {1,100,1,1,1,100,1,1,100,1}; minCostClimbingStairs(array1); } public static int minCostClimbingStairs(int[] cost) { int len = cost.length; int[] dp = new int[len + 1]; dp[0] = 0; dp[1] = 0; for (int i = 2; i <= len; i++) { dp[i] = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]); System.out.println(dp[i]); } return dp[len]; }
2.不同路径(leetcode62)
(1)确定dp[i][j]含义 到达i,j位置有多少种不同的路径
(2)递推公式: dp[i][j]=dp[i-1][j]+dp[i][j-1]
(3)dp数组如何初始化: dp[0][j]=1 dp[i][0]=1
(4)遍历顺序: 从上向下遍历 从左向右遍历
(5)打印dp数组
public int uniquePaths(int m, int n) { int[][] dp = new int[m][n]; for (int i = 0; i < m; i++) { dp[i][0] = 1; } for (int i = 0; i < n; i++) { dp[0][i] = 1; } for (int i = 1; i < m; i++) { for (int j = 1; j < n; j++) { dp[i][j] = dp[i - 1][j] + dp[i][j - 1]; } } return dp[m - 1][n - 1]; }