You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
|
/*/*******************************************************************************
|
|
|
|
|
|
** **
|
|
|
|
|
|
** Jiedi(China nanjing)Ltd. **
|
|
|
|
|
|
** 创建：丁宋涛 夏曹俊，此代码可用作为学习参考 **
|
|
|
|
|
|
*******************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************FILE INFOMATION***********************************
|
|
|
|
|
|
**
|
|
|
|
|
|
** Project : 算法设计与编程实践---基于leetcode的企业真题库
|
|
|
|
|
|
** Contact : xiacaojun@qq.com
|
|
|
|
|
|
** 博客 : http://blog.csdn.net/jiedichina
|
|
|
|
|
|
** 视频课程 : 网易云课堂 http://study.163.com/u/xiacaojun
|
|
|
|
|
|
腾讯课堂 https://jiedi.ke.qq.com/
|
|
|
|
|
|
csdn学院 https://edu.csdn.net/course/detail/25037
|
|
|
|
|
|
** 51cto学院 http://edu.51cto.com/lecturer/index/user_id-100013755.html
|
|
|
|
|
|
** 老夏课堂 http://www.laoxiaketang.com
|
|
|
|
|
|
**
|
|
|
|
|
|
** 算法设计与编程实践---基于leetcode的企业真题库 课程群 ：296249312 加入群下载代码和交流
|
|
|
|
|
|
** 微信公众号 : jiedi2007
|
|
|
|
|
|
** 头条号 : 夏曹俊
|
|
|
|
|
|
**
|
|
|
|
|
|
*****************************************************************************
|
|
|
|
|
|
//！！！！！！！！！ 算法设计与编程实践---基于leetcode的企业真题库 课程 QQ群：296249312 下载代码和交流*/
|
|
|
|
|
|
/*
|
|
|
|
|
|
* @lc app=leetcode.cn id=70 lang=cpp
|
|
|
|
|
|
*
|
|
|
|
|
|
* [70] 爬楼梯
|
|
|
|
|
|
* 1个台阶：1
|
|
|
|
|
|
* 2个台阶：2
|
|
|
|
|
|
* 3个台阶：3
|
|
|
|
|
|
* 4个台阶：5
|
|
|
|
|
|
* 1+1+1+1，1+1+2，1+2+1，2+2，2+1+1
|
|
|
|
|
|
*/
|
|
|
|
|
|
class Solution {
|
|
|
|
|
|
public:
|
|
|
|
|
|
int fab(int n){
|
|
|
|
|
|
if(n==1 || n ==0){
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
else
|
|
|
|
|
|
{
|
|
|
|
|
|
return fab(n-2)+fab(n-1);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
int climbStairs(int n) {
|
|
|
|
|
|
//return fab(n);
|
|
|
|
|
|
int sum;
|
|
|
|
|
|
int num;//num是用来产生fab
|
|
|
|
|
|
if(n==1 || n ==0){
|
|
|
|
|
|
return 1;
|
|
|
|
|
|
}
|
|
|
|
|
|
if(n==2)
|
|
|
|
|
|
return 2;
|
|
|
|
|
|
|
|
|
|
|
|
sum = 2;
|
|
|
|
|
|
long long num_1 = 1;
|
|
|
|
|
|
long long num_2 = 2;
|
|
|
|
|
|
long long temp = 0;
|
|
|
|
|
|
for(int i=2;i<n;i++){
|
|
|
|
|
|
temp = num_2;
|
|
|
|
|
|
num_2 = num_1+num_2;
|
|
|
|
|
|
num_1 = temp;
|
|
|
|
|
|
}
|
|
|
|
|
|
return num_2;
|
|
|
|
|
|
}
|
|
|
|
|
|
};
|
|
|
|
|
|
|
