力扣【62】不同路径

题解：

这是个杨辉三角形，每个位置的路径 = 该位置左边的路径 + 该位置上边的路径

package test;

class Solution {
    public 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 < n; i++) {//把这里错写为m了...
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        return dp[m - 1][n - 1];
    }
}

public class Main{
    public static void main (String []args){
        int m = 3;
        int n = 7;
        Solution p = new Solution();
        int b = p.uniquePaths(m, n);
        System.out.print(" " + b);
    }
}