# 62 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?
Note: m and n will be at most 100.

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

public class Solution {
public int uniquePaths(int m, int n) {
if(m <= 0 || n <= 0)
return 0;
int[] res = new int[n];
res[0] = 1;
for(int i = 0; i < m; i ++) {
for(int j = 1; j < n; j ++) {
res[j] = res[j] + res[j - 1];
}
}
return res[n - 1];
}
}
61 / 61 test cases passed.
Status: Accepted
Runtime: 0 ms