题解 | #跳台阶#

import java.util.*;


public class Solution {

    public static Map<Integer,Integer> jumpMap = new HashMap<>();
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param number int整型 
     * @return int整型
     */
    public int jumpFloor (int number) {
        // write code here
         if(number == 0){
            jumpMap.put(0,0);
            return 0;
        }

        if(number == 1){
            jumpMap.put(1,1);
            return 1;
        }

        if(number == 2){
            jumpMap.put(2,2);
            return 2;
        }

        if(jumpMap.containsKey(number)){
            return jumpMap.get(number);
        }

        int result = jumpFloor(number - 1) + jumpFloor(number - 2);
        jumpMap.put(number, result);
        return result;
    }
}