Commit 4bca22a

committed

add q64

1 parent cded4a2 commit 4bca22aCopy full SHA for 4bca22a

File tree

+43

-16

lines changed

+43

-16

lines changed

Lines changed: 16 additions & 16 deletions

Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

Lines changed: 1 addition & 0 deletions

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+package 动态规划.q64_最小路径和;`
	`2`	`+`
	`3`	`+/**`
	`4`	`+ * 动态规划 dp(j)=grid(i,j)+min(dp(j),dp(j+1)) o(m*n)`
	`5`	`+ */`
	`6`	`+public class Solution {`
	`7`	`+`
	`8`	`+ public int minPathSum(int[][] grid) {`
	`9`	`+ int[] dp = new int[grid[0].length];`
	`10`	`+ for (int i = grid.length - 1; i >= 0; i--) {`
	`11`	`+ for (int j = grid[0].length - 1; j >= 0; j--) {`
	`12`	`+ if (i == grid.length - 1 && j != grid[0].length - 1) {`
	`13`	`+ dp[j] = grid[i][j] + dp[j + 1];`
	`14`	`+ } else if (j == grid[0].length - 1 && i != grid.length - 1) {`
	`15`	`+ dp[j] = grid[i][j] + dp[j];`
	`16`	`+ } else if (j != grid[0].length - 1 && i != grid.length - 1) {`
	`17`	`+ dp[j] = grid[i][j] + Math.min(dp[j], dp[j + 1]);`
	`18`	`+`
	`19`	`+ } else {`
	`20`	`+ dp[j] = grid[i][j];`
	`21`	`+ }`
	`22`	`+ }`
	`23`	`+ }`
	`24`	`+ return dp[0];`
	`25`	`+ }`
	`26`	`+}`

Comments

(0)