牛客-跳臺階
#include <stdio.h>
#include <queue>
#include <stack>
#include <math.h>
#include <map>
#include <string.h>
#include <string>
#include <cstring>
#include <set>
#include <algorithm>
#include <vector>
using namespace std;
class Solution {
public:
int jumpFloor(int number) {
if (number==0 || number==1) {
return 1;
}
int last1 = 1;
int last2 = 1;
int ans = 0;
for (int i=2; i<=number; i++) {
ans = last1+last2;
last1 = last2;
last2 = ans;
}
return ans;
}
};