Leetcode每日一题（Unique Paths）

A robot is located at the top-left corner of amxngrid (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?

所以分析到现在发现竟然是一样的：

实现方法：

这是最简单的一种了，参考下面的链接可以得到计算组合数更好的方法了。

http://my.oschina.net/baoer1024/blog/62826