Unique Paths
来源:互联网 发布:如何进入淘宝试用中心 编辑:程序博客网 时间:2024/04/18 22:38
题目:
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?
我的解法:
(1)算法思想:
根据m,n值,设一个矩阵matrix[m-1][n-1],矩阵最上面一行和最左边一列的值都为1,其他位置元素的值等于相邻左边元素的值加上上边元素的值。这样,右下角元素的值就是可能有的路径数。
(2)代码如下:
1 0
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- CAAnimationGroup
- 2015.1学习笔记
- Java泛型
- Gallery3d 学习笔记(16)
- Android自定义图形图像,可实现圆角背景
- Unique Paths
- No resource found that matches the given name 'Theme.AppCompat.Light 的完美解决方案
- DOM 插入标记
- FZU 2178 礼物分配 (折半搜索+二分)
- JAVA方法DataOutputStream.writeBytes(String s)传递中文乱码问题
- spring 事件监听
- GLSL 内建函数
- [Leetcode] 38 - Count and Say
- 初步学习界面编程