题解 | #跳台阶#
跳台阶
http://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4
采用递归的思想进行解决类似斐波那契列数的解决方案
#include <iostream>
int main() {
std::cout << "Hello World!";
return 0;
}
class HelloWorld {
public static void main(String[] args) {
System.out.println("Hello, World!");
}
}
print('Hello world!')
class Solution(Object):
def jumpFloor(self, number):
# define one list
temp_list = list()
temp_list.append(1)
temp_list.append(1)
for i in range(2,number+1):
temp_list.append(temp_list[i-1]+temp_list[i-2])
return temp_list[number]