Practice-Leetcode/uniquePathsMatrix.cpp at master · adilhamid/Practice-Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
class Solution {
public:
    int uniquePaths(int m, int n) {
        if(m==1) return 1;

        if(m>n) swap(m,n);

        vector<int> cur(m,1);

        for(int j=1; j<n; j++){
            for(int i =1; i<m; i++){
                cur[i] += cur[i-1];
            }
        }

        return cur[m-1];
    }
};