当前位置：网站首页>Leetcode-62-different paths

Leetcode-62-different paths

2022-07-18 09:28:00 【z754916067】

subject

Insert picture description here

Ideas

a glance dp, Direct solution to .

Code

    public int uniquePaths(int m, int n) {
    
        //dp Array is from 0,0 Start to i,j The number of paths 
        int[][] dp = new int[m][n];
        for(int i=0;i<n;i++) dp[0][i]=1;
        for(int i=0;i<m;i++) dp[i][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];
    }