Unique Paths
来源:互联网 发布:开微店好还是淘宝店好 编辑:程序博客网 时间:2024/05/19 15:20
class Solution {
public:
int a[1000][1000]={{0}};
int uniquePaths(int m, int n) {
// int a[m+1][n+1]={0};
return dfs(m,n);
}
private:
int dfs(int m,int n)
{
if(m==0||n==0) return 0;
if(m==1) return 1;
if(n==1) return 1;
return getUpdate(m-1,n)+getUpdate(m,n-1);
}
int getUpdate(int m,int n)
{
if(a[m][n]>0) return a[m][n];
else return a[m][n]=dfs(m,n);
}
}; //备忘录法
public:
int a[1000][1000]={{0}};
int uniquePaths(int m, int n) {
// int a[m+1][n+1]={0};
return dfs(m,n);
}
private:
int dfs(int m,int n)
{
if(m==0||n==0) return 0;
if(m==1) return 1;
if(n==1) return 1;
return getUpdate(m-1,n)+getUpdate(m,n-1);
}
int getUpdate(int m,int n)
{
if(a[m][n]>0) return a[m][n];
else return a[m][n]=dfs(m,n);
}
}; //备忘录法
0 0
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- IOS编程第四版第二章:Objective-C
- LeetCode | Contains Duplicate III
- 浅谈 MVP in Android
- __LINE__ __FILE__的用法
- windows下ACtiveMQ服务器搭建
- Unique Paths
- UVA_2533 Chess Queen(math)
- C与C++在opencv中的区别
- oracle 导出表结构
- leetcode 9 Palindrome Number 回文数
- myeclipse-Linux-安装步骤
- 硬盘安装debian 8.1
- 08-排序5. Sort with Swap(0,*) (25)
- oracle子查询