Java 剑指offer之 递归青蛙跳、变态青蛙跳

青蛙跳
一只青蛙一次可以跳上1级台阶，也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。

import java.util.Scanner;
public class QingWaTiao {
    public int jumpFloor(int target){
        int count =0;
        if(target <=0)
            return count;
        else if(target==1)
            return 1;
        else if(target==2)
            return 2;
        else
            {count = jumpFloor(target-1)+jumpFloor(target-2);
            return count;}
    }
    public static void main(String[] args) {
        QingWaTiao q= new QingWaTiao();
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int num;
        num = q.jumpFloor(n);
        System.out.println(num);
    }
}

变态青蛙跳
一只青蛙一次可以跳上1级台阶，也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。

import java.util.Scanner;

public class BianTaiQingWaTiao {
    public int jumpFloor(int target){
        int count =0;
        if(target <=0)
            return count;
        else if(target==1)
            return 1;
        else if(target==2)
            return 2;
        else{
            for(int j=0;j<target;j++)
                count = count+jumpFloor(j);  
            count =count+1;
            return count;
            }
    }
    public static void main(String[] args) {
        BianTaiQingWaTiao q= new BianTaiQingWaTiao();
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int num;
        num = q.jumpFloor(n);
        System.out.println(num);
    }
}