leetcode—— 62——Unique Paths
来源:互联网 发布:js 通过代理解决跨域 编辑:程序博客网 时间:2024/06/09 23:34
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.
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]; }};
0 0
- LeetCode—Unique Paths
- LeetCode——Unique Paths
- LeetCode——Unique Paths
- Leetcode——Unique Paths
- leetcode——Unique Paths & Unique PathsⅡ
- LeetCode——Unique Paths II
- LeetCode——Unique Paths II
- LeetCode——Unique Paths II
- leetcode 062 —— Unique Paths
- leetcode 063 —— Unique Paths II
- Leetcode题集——unique-paths-ii
- leetcode—— 62——Unique Paths
- 【leetcode】Array——Unique Paths(62)
- LeetCode 62 — Unique Paths(C++ Java Python)
- leetcode——63—— Unique Paths II
- 【leetcode】Array——Unique Paths II(63)
- LeetCode算法题——Unique Paths I & II
- LeetCode62——Unique Paths
- Tomcat运行Java Web内存溢出总结
- Activity的生命周期
- 面向对象java
- php面试题之一——PHP核心技术(高级部分)
- android6.0中permission授予机制的改变
- leetcode—— 62——Unique Paths
- Eclipse创建Struts2项目
- 关于部分Unity发布IOS报错的解决办法
- JSP内置对象
- 创建django项目
- SVN终端命令汇总
- Html基础知识
- jQuery
- 前端学习刷题中