瓜子面试题
思路:动态规划求解即可。
代码:
public class UniquePaths62 {
public static void main(String[] args) {
System.out.println(uniquePaths(7, 3));
}
public static int uniquePaths(int m, int n) {
int[][] dp = new int[m][n];
for (int i = 0; i < n; i++)
dp[0][i] = 1;
for (int j = 0; j < m; j++)
dp[j][0] = 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];
}
}
输出:
也可以采用递归来做,不过leetcode会报超时。
class Solution {
public int uniquePaths(int m, int n) {
if(m==1||n==1)
return 1;
return uniquePaths(m-1, n)+uniquePaths(m, n-1);
}
}