Commit 7994f89

committed

add q62

1 parent 522f0c7 commit 7994f89Copy full SHA for 7994f89

File tree

+30

-0

lines changed

+30

-0

lines changed

Lines changed: 3 additions & 0 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 动态规划.q62_不同路径;`
	`2`	`+`
	`3`	`+/**`
	`4`	`+ * 动态规划 dp[i][j]是到达i, j的最多路径 dp[i][j] = dp[i-1][j] + dp[i][j-1] o(m*n)`
	`5`	`+ */`
	`6`	`+public class Solution {`
	`7`	`+`
	`8`	`+ public int uniquePaths(int m, int n) {`
	`9`	`+ if (m < 1 \|\| n < 1) {`
	`10`	`+ return 0;`
	`11`	`+ }`
	`12`	`+ int[][] dp = new int[m][n];`
	`13`	`+ for (int i = 0; i < n; i++) {`
	`14`	`+ dp[0][i] = 1;`
	`15`	`+ }`
	`16`	`+ for (int i = 0; i < m; i++) {`
	`17`	`+ dp[i][0] = 1;`
	`18`	`+ }`
	`19`	`+ for (int i = 1; i < m; i++) {`
	`20`	`+ for (int j = 1; j < n; j++) {`
	`21`	`+ dp[i][j] = dp[i - 1][j] + dp[i][j - 1];`
	`22`	`+ }`
	`23`	`+ }`
	`24`	`+ return dp[m - 1][n - 1];`
	`25`	`+ }`
	`26`	`+}`

Comments

(0)