11

代码说明：

说明：  一只青蛙一次可以跳上1级台阶，也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。要求：分别用普通方法和递归方法实现(A frog can jump up a step or two at a time. Find out how many jumping methods the frog can use to jump up an n-step. Requirements: Implemented by common method and recursive method respectively)

文件列表：

11\.classpath, 301 , 2018-10-28
11\.project, 378 , 2018-10-28
11\.settings, 0 , 2019-03-10
11\.settings\org.eclipse.core.resources.prefs, 66 , 2018-10-28
11\.settings\org.eclipse.jdt.core.prefs, 598 , 2018-10-28
11\bin, 0 , 2019-03-10
11\bin\Main.jpg, 17238 , 2018-12-02
11\bin\Solution.class, 1122 , 2018-12-03
11\src, 0 , 2019-03-10
11\src\Main.jpg, 17238 , 2018-12-02
11\src\Solution.java, 639 , 2018-11-25