LeetCode--70--easy--ClimbingStairs

微观尽头

于 2019-12-09 20:44:25 发布

阅读量96

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/huangdingsheng/article/details/103464919

版权

LeetCode 专栏收录该内容

199 篇文章 0 订阅

订阅专栏

package com.app.main.LeetCode.dynamic;

/**
 *
 * 70
 *
 * easy
 *
 * You are climbing a stair case. It takes n steps to reach to the top.
 *
 * Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
 *
 * Note: Given n will be a positive integer.
 *
 * Example 1:
 *
 * Input: 2
 * Output: 2
 * Explanation: There are two ways to climb to the top.
 * 1. 1 step + 1 step
 * 2. 2 steps
 * Example 2:
 *
 * Input: 3
 * Output: 3
 * Explanation: There are three ways to climb to the top.
 * 1. 1 step + 1 step + 1 step
 * 2. 1 step + 2 steps
 * 3. 2 steps + 1 step
 *
 *
 * Created with IDEA
 * author:Dingsheng Huang
 * Date:2019/12/9
 * Time:下午8:15
 */
public class ClimbingStairs {

    public int climbStairs(int n) {
        if (n == 1) {
            return 1;
        }
        if (n == 2) {
            return 2;
        }
//        int[] dp = new int[n];
//        dp[0] = 1;
//        dp[1] = 2;
        int pre = 2;
        int pre2 = 1;
        int curr = 0;
        for (int i = 2; i < n; i++) {
            curr = pre + pre2;
            pre2 = pre;
            pre = curr;
        }
        return curr;
    }
}