C++ 编程练习题目（青蛙跳台阶）

C++ 编程练习题目（第一个月）

青蛙跳台阶–递归

代码（循环）

class Solution {
public:
    int jumpFloor(int number) {
        if (number <= 0) {
            return 0;
        }
        if (number <= 2){
            return number;
        }
        int first = 1, second = 2, res = 0;
        for (int i = 3; i <= number; ++i){
            
            res = first + second;
            first = second;
            second = res;
            
        }
        return res;
    }
};

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
 

代码（递归）

class Solution {
public:
    int jumpFloor(int number) {
        if (number <= 0) {
            return 0;
        }
        if (number <= 2){
            return number;
        }
        return jumpFloor(number - 1) + jumpFloor(number - 2);
        
        
    }
};

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
 

完整可运行代码

#include <iostream>

#include <stdlib.h>

using namespace std;

class Solution {
public:
    int jumpFloor(int number) {
        if (number <= 0) {
            return 0;
        }
        if (number <= 2){
            return number;
        }
        int first = 1, second = 2, res = 0;
        for (int i = 3; i <= number; ++i){
            
            res = first + second;
            first = second;
            second = res;
            
        }
        return res;
    }
};

int main(int argc, char *argv[]){
	Solution fun;
    cout<<"jumpFloor( "<< argv[1] << " ) = "	<< fun.jumpFloor(atoi(argv[1])) <<endl;
	return 0;
}


  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
 

文章来源: positive.blog.csdn.net，作者：墨理学AI，版权归原作者所有，如需转载，请联系作者。

原文链接：positive.blog.csdn.net/article/details/114678977