leetcode62Unique Paths
来源:互联网 发布:淘宝买家的退货率 编辑:程序博客网 时间:2024/04/30 08:06
class Solution(object):
def uniquePaths(self, m, n):
"""
:type m: int
:type n: int
:rtype: int
dp=[[1]*n for x in range(m)]
for i in range(1,m):
for j in range(1,n):
dp[i][j]=dp[i-1][j]+dp[i][j-1]
return dp[-1][-1]
"""
dp=[1]*m
for j in range(1,n):
for i in range(1,m):
dp[i]+=dp[i-1]
def uniquePaths(self, m, n):
"""
:type m: int
:type n: int
:rtype: int
dp=[[1]*n for x in range(m)]
for i in range(1,m):
for j in range(1,n):
dp[i][j]=dp[i-1][j]+dp[i][j-1]
return dp[-1][-1]
"""
dp=[1]*m
for j in range(1,n):
for i in range(1,m):
dp[i]+=dp[i-1]
return dp[-1]
方法一:
和算最小和一样,先算行0和列0,相加
方法二:
先直接算向下走,走列次,一直摆到最后一个
0 0
- leetcode62Unique Paths
- Paths
- Paths
- Paths
- Paths
- Paths
- Paths
- Paths
- Paths
- Paths
- Paths
- Paths
- angowx paths
- paths 整理
- Symbol Paths
- Unique Paths
- Unique Paths
- Unique Paths
- UAAC 访问 Predix UAA 入门
- 花式最短路题目总结
- Hibernate 常用更新数据方法(机制)
- 商业智能解决方案不完全等于数据分析
- Oracle 导出导入数据
- leetcode62Unique Paths
- Problem B: 点在圆内吗?
- Caffe学习系列(2):数据层及参数
- [Python]模块和包
- 浅谈HTTP
- leetcode 61Rotate List
- Problem C: 重载字符的加减法
- leetcode60Permutation Sequence
- 通信协议——Http、TCP、UDP