[LeetCode-Algorithms-62] "Unique Paths" (2017.11.21-WEEK12)
来源:互联网 发布:软件启动页面 编辑:程序博客网 时间:2024/05/24 01:52
题目链接: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.
(1)思路:动态规划,对于点(i, j),只能从上边的点(i-1,j)或者左边的点(i,j-1)到达,且两者路径是不重复的,因此path[i][j] = path[i-1][j]+path[i][j-1]。
(2)代码:
class Solution {public: int uniquePaths(int m, int n) { vector<vector<int> > path(m, vector<int>(n, 1)); for(int i = 1; i < m; i ++) { for(int j = 1; j < n; j ++) { path[i][j] = path[i-1][j] + path[i][j-1]; } } return path[m-1][n-1]; }};
(3)提交结果:
阅读全文
0 0
- [LeetCode-Algorithms-62] "Unique Paths" (2017.11.21-WEEK12)
- 算法设计Week12 LeetCode Algorithms Problem #62 Unique Paths
- 算法设计Week12 LeetCode Algorithms Problem #63 Unique Paths II
- [LeetCode-Algorithms-49] "Group Anagrams" (2017.11.21-WEEK12)
- [leetcode 62] Unique Paths
- LeetCode(62): Unique Paths
- [LeetCode 62]Unique Paths
- leetcode || 62、Unique Paths
- Unique Paths - LeetCode 62
- leetcode-62 Unique Paths
- Leetcode[62]-Unique Paths
- leetcode 62:Unique Paths
- Leetcode #62 Unique Paths
- leetcode 62: Unique Paths
- Leetcode#62||Unique Paths
- LeetCode 62: Unique Paths
- 【leetcode】【62】Unique Paths
- leetcode #62 Unique Paths
- 重温char类型
- win32拖拽TXT文本
- Java中多级文件夹复制
- cgi入门
- 《App后台开发运维和架构实践》读书笔记
- [LeetCode-Algorithms-62] "Unique Paths" (2017.11.21-WEEK12)
- Spring Boot自定义starter【周三更新】【 Spring Boot视频】
- MySQL存储过程中的3种循环
- Retrofit 源码简单分析
- MySql数据的启动和停止以及SQLyog图形化工具的下载
- RocketMQ集群部署配置
- 《弃子长安》第一章 兰芷凝香
- 第三方QQ登陆的流程
- 程序之路才刚开始呢!