Simple C++ 0ms dp solution with O(n) space


  • 0
    J
    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] + dp[j];
        
        return dp.back();
    }

Log in to reply
 

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