unique path I

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