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.

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    int uniquePaths(int m, int n) {
        int nn = m+n-2;
        if (nn == 0) return 1;
        const int k = min(m, n)-1;
        long long result = 1;
        int count = 1;
        while (count <= k) result = result*(nn--)/(count++);
        return result;
    }
};</span>