采用动态规划(DP)求解Unique Paths问题
问题描述
原题链接:https://leetcode.com/problems/unique-paths/description/
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.
问题分析
这个题目是从一个3*7的矩阵(方格)中&