[leetcode][*]Unique Paths

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

How many possible unique paths are there?

Above is a 3 x 7 grid. How many possible unique paths are there?

Note: m and n will be at most 100.

int uniquePaths(int m, int n) {
        int table[n][m];
        if(m == 0 || n == 0) return 0;
        for(int i = 0; i < n; ++i){
            for(int j = 0; j < m; ++j){
                if(i == 0 && j == 0) table[i][j] = 1;
                else if(i == 0 && j != 0) table[i][j] = table[i][j-1];
                else if(i != 0 && j == 0) table[i][j] = table[i-1][j];
                else{
                    table[i][j] = table[i-1][j]+table[i][j-1];
                }
            }
        }
        return table[n-1][m-1];
    }