# Middle-题目21：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?

public class Solution {
public int uniquePaths(int m, int n) {
int[][] dp=new int[m][n];
for(int i=0;i<m;i++)
dp[i][0]=1;
for(int i=0;i<n;i++)
dp[0][i]=1;
for(int i=1;i<m;i++)
for(int j=1;j<n;j++)
dp[i][j]=dp[i-1][j]+dp[i][j-1];
return dp[m-1][n-1];
}
}

1ms,beats 5.98%,众数1ms,77.94%
cmershen的碎碎念：

#### LeetCode 62 — Unique Paths（C++ Java Python）

2014-02-23 22:00:50

#### leetCode 62.Unique Paths （唯一路径） 解题思路和方法

2015-07-15 14:23:47

#### 62 Unique Paths

2015-10-14 21:49:20

#### leetcode 62. Unique Paths-唯一路径|动态规划

2016-03-11 15:16:22

#### 【LeetCode with Python】 Unique Paths

2014-08-29 18:11:24

#### Unique Paths -- LeetCode

2014-03-26 04:13:48

#### LeetCode-62-Unique Paths(动态规划)-Medium

2016-03-14 08:51:58

#### Unique Paths II -- LeetCode

2014-03-26 04:15:28

#### 62-Unique Paths

2017-06-23 15:36:01

#### LeetCode 62. Unique Paths （Python）

2017-08-08 20:19:50