C++ 0ms O(n)-Space 5-lines Solution


  • 0
    L
    class Solution {
    public:
        int uniquePaths(int m, int n) {
            vector<int> DP(n,1);
            for(int i=1; i<m; i++)
                for(int j=1; j<n; j++)
                    DP[j] += DP[j-1];
            return DP[n-1];
        }
    };
    

Log in to reply
 

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