22_Unique_Paths.cpp

#include <iostream>
using namespace std;

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

int main()
{
    int m = 7, n = 0;
    Solution s;
    cout << s.uniquePaths(m, n) << endl;
    return 0;
}