Leetcode Unique Paths
来源:互联网 发布:巨人网络2016财报 编辑:程序博客网 时间:2024/05/18 03:17
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.
Difficulty: Medium
Solution: DP
public class Solution { public int uniquePaths(int m, int n) { if(m < 1 || n < 1) return 0; if(m == 1 || n == 1) return 1; int[][] grid = new int[m][n]; grid[0][0] = 1; for(int i = 0; i < m; i++){ for(int j = 0; j < n; j++){ if(i > 0){ grid[i][j] += grid[i - 1][j]; } if(j > 0){ grid[i][j] += grid[i][j - 1]; } } } return grid[m - 1][n - 1]; }}
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
- 读取.csv数据/写入另外一个.csv (Python)
- java链表的数据结构和二叉树的实现
- (OK)(OK) Install Docker on Fedora 23
- 1.简介
- Java中的继承:父类和子类的关系
- Leetcode Unique Paths
- JavaScript 高级框架设计
- ROW_NUMBER()的用法
- SPAF
- java巩固再看回调函数
- ROW_NUMBER基本用法
- 【codeforces】HDD is Outdated Technology
- FZU-2140-Forever 0.5
- windows 进程通信之管道详解 :