/* 记忆化搜索*/ class Solution { public: /*记忆化搜索*/ int F[10000] = {1,1}; int jumpFloor(int number) { if(number == 0 || number == 1) { F[0] = 1; F[1] = 1; } for(int i=2; i <= number; i++) F[i] = F[i-1] + F[i-2]; ...