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 7 x 3 grid. How many possible unique paths are there?
Note: m and n will be at most 100.
Example 1:
Input: m = 3, n = 2 Output: 3 Explanation: From the top-left corner, there are a total of 3 ways to reach the bottom-right corner: 1. Right -> Right -> Down 2. Right -> Down -> Right 3. Down -> Right -> Right
Example 2:
Input: m = 7, n = 3 Output: 28
解题思路:转化为数学的排列组合问题,即在m-1个向右的标志之间,放入n-1个向下的小球(小球完全一样),是不是有点排列组合的感觉了?不过这题的排列组合也不是太好解。首先将小球看为不一样的,我们进行编号,1-n-1号,1号小球有m+1个位置(两端也要算),2号小球有m+2个位置(由于1号球的加入,相当于现在有m个标志),由此类推,知道n-1小球;然后由于小球完全一样,分母还要除以n-1的排列数,化简就有结果为
另外,需要用double保存分子分母。
class Solution {
public:
int uniquePaths(int m, int n) {
double a=1,b=1;
n--;
for(int i=1;i<=n;i++){
a*=(m++);
b*=i;
}
return b==0 ? 1 :(int)(a/b);
}
};