[算法] - 上台阶问题(动态规划)

package com.jfp;

/**
 * @author jiafupeng
 * @desc
 * @create 2021/3/17 14:37
 * @update 2021/3/17 14:37
 **/
public class Test2 {

    static int getClimbingWays(int n){
        if(n < 1){
            return 0;
        }

        if(n == 1){
            return 1;
        }

        if(n == 2){
            return 2;
        }

        int a = 1;
        int b = 2;
        int sum = 0;
        for(int i = 3;i<=n;i++){
            sum = a + b;
            a = b;
            b = sum;
        }

        return sum;
    }

    public static void main(String[] args) {
        int climbingWays = getClimbingWays(10);
        System.out.println(climbingWays);
    }
}