C++ code, 2ms, dynamic programming


  • 0
    Z
    class Solution {
    public:
        int uniquePaths(int m, int n) {
            if(m<1 || n<1) return 0;
            if(m==1) return 1;
            if(n==1) return 1;
            int **A=new int*[m];
            for(int i=0;i<m;i++)
            A[i]=new int[n];
            for(int j=0;j<n;j++)
            A[0][j]=1;
            for(int i=1;i<m;i++)
            A[i][0]=1;
            for(int i=1;i<m;i++)
            for(int j=1;j<n;j++)
            A[i][j]=A[i-1][j]+A[i][j-1];
            return A[m-1][n-1];
        }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.