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?


62. Unique Paths_第1张图片
dummy pic

Above is a 3 x 7 grid. How many possible unique paths are there?
Note: m and n will be at most 100.


Fairly easy piece of cake. 最短路径 动态规划

class Solution {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        for(int i = 0;i

你可能感兴趣的:(62. Unique Paths)