LeetCode Unique Paths
2015-11-19 21:01
429 查看
题目:
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?
Note: m and n will be at most 100.
题意:
给定一个m*n的格子,每一个格子只能向右走或者是向下走,然后计算从最左上的那个格子开始走到最右下的那个格子,共有几种走法?此题考虑典型的动态规划,而且此题与之前的关于走格子计算最大值和最小值都很像,但是此题要注意的是,最上面的那一行和最左边的那一列都是1,因为只有一种走法,所以只有1.其他与之前的那种类型一样。
public class Solution
{
public static int uniquePaths(int m,int n)
{
int[][] nums = new int[m]
;
nums[0][0] = 1;
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
if(i > 0 && j > 0)
nums[i][j] = nums[i-1][j] + nums[i][j-1];
if(i == 0 && j > 0)
nums[i][j] = 1;
if(i > 0 && j == 0)
nums[i][j] = 1;
}
}
return nums[m-1][n-1];
}
}
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?
Note: m and n will be at most 100.
题意:
给定一个m*n的格子,每一个格子只能向右走或者是向下走,然后计算从最左上的那个格子开始走到最右下的那个格子,共有几种走法?此题考虑典型的动态规划,而且此题与之前的关于走格子计算最大值和最小值都很像,但是此题要注意的是,最上面的那一行和最左边的那一列都是1,因为只有一种走法,所以只有1.其他与之前的那种类型一样。
public class Solution
{
public static int uniquePaths(int m,int n)
{
int[][] nums = new int[m]
;
nums[0][0] = 1;
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
if(i > 0 && j > 0)
nums[i][j] = nums[i-1][j] + nums[i][j-1];
if(i == 0 && j > 0)
nums[i][j] = 1;
if(i > 0 && j == 0)
nums[i][j] = 1;
}
}
return nums[m-1][n-1];
}
}
相关文章推荐
- HDOJ--2767--Proving Equivalences
- UI - UIPickerView
- leetcode 63:Unique Paths II
- Android进阶-复杂的UI框架(一)
- maven项目出现web.xml is missing and <failOnMissingWebXml> is set to true错误的解决办法
- leetcode 62:Unique Paths
- Android进阶-如何避免频繁修改UI代码
- UI基础_UITableView
- Android进阶-子线程中刷新UI的讨论
- UIView与AVLayer
- ### Error building SqlSession.
- 芒果iOS开发UI课程第三节UITextField
- UI - UIDatePicker
- 教你如何开发VR游戏系列教程四:UI 设计
- CharSequence的getText()与String的getString()区别和为什么加""
- 响应者链和 UILabel的userInteractionEnabled属性
- 《iOS Human Interface Guidelines》——Design Principles
- 利用 UIAppearance 协议自定义控件外观
- UI学习之常用方法(续)
- UITableViewCell自定义高度