Leetcode 62. Unique Paths

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

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

Reference

1. https://leetcode.com/problems/unique-paths/description/