路径总数

路径总数(Unique Paths)

难度：Easy
备注：出自leetcode
题目描述
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)
来源：牛客-leetcode
来源：力扣：62 不同路径
题目描述：
在一个m*n的网格的左上角有一个机器人，机器人在任何时候只能向下或者向右移动，
机器人试图到达网格的右下角，有多少可能的路径。

• 方法：动态规划
• 状态：
  子状态：从(0,0)到达(1,0),(1,1),(2,1),…(m-1,n-1)的路径数
  F(i,j): 从(0,0)到达F(i,j)的路径数
• 状态递推：
  F(i,j) = F(i-1,j) + F(i,j-1)
• 初始化：
  特殊情况：第0行和第0列
  F(0,i) = 1
  F(i,0) = 1