题解 | #求路径#

class Solution { public: /** * * @param m int整型 * @param n int整型 * @return int整型 */ int uniquePaths(int m, int n) { // write code here vector<vector> res(m, vector(n, 0));

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

};