LeetCode-Unique Paths
来源:互联网 发布:足不出户而知天下三分 编辑:程序博客网 时间:2024/04/30 05:47
作者:disappearedgod
文章出处:http://blog.csdn.net/disappearedgod/article/details/30244919
时间:2014-6-12
题目
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?
Above is a 3 x 7 grid. How many possible unique paths are there?
Note: m and n will be at most 100.
解法
DP解法
public class Solution { public int uniquePaths(int m, int n) { if(m==0||n==0) return 0; if(n==1||m==1) return 1; int[][] r = new int[m][n]; r[m-1][n-1] = 1; for(int i = m-1 ; i >= 0 ; i--){ for(int j = n-1; j >= 0; j--){ if(i>0) r[i-1][j] += r[i][j]; if(j>0) r[i][j-1] += r[i][j]; } } return r[0][1]+r[1][0]; }}
0 0
- leetcode Unique Paths && Unique Paths
- Leetcode-Unique Paths&Unique PathsII
- [LeetCode] Unique Paths and Unique Paths II
- leetcode--Unique Paths && Unique Paths ii
- leetcode--Unique Paths && Unique Paths ii
- 【Leetcode】【python】Unique Paths/Unique Paths II
- LeetCode: Unique Paths
- LeetCode: Unique Paths II
- [Leetcode] Unique Paths
- [Leetcode] Unique Paths II
- LeetCode : Unique Paths
- LeetCode : Unique Paths II
- leetcode 9: Unique Paths
- [LeetCode] Unique Paths
- [LeetCode] Unique Paths II
- [LeetCode]Unique Paths
- [LeetCode]Unique Paths II
- [LeetCode] Unique Paths
- 第三周作业 归并排序(接)
- 读取properties属性文件——国际化
- Uncrustify - 代码强制规范
- hbase存取图片
- 1 Swift语法特性
- LeetCode-Unique Paths
- curl多线程注意事项
- automake连载--Linux下使用automake入门
- IO多路复用之epoll总结
- Tomcat下部署多个项目
- 刷票大战(三)——C#自动POST数据
- 1001
- Ubuntu12.04编译问题总结
- poco 网络库