Leetcode——70. Climbing Stairs

题目原址

https://leetcode.com/problems/climbing-stairs/description/

题目描述

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.

Example1：

Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example2：

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

解题思路

这个题是一道动态规划的题，当前的步数只与前两步的步数有关系。该题使用ways[0]存储n-2的步数，ways[1]存储n-1的步数

AC代码

class Solution {
    public int climbStairs(int n) {
        int[] ways = {1,1};
        for(int i = 1; i < n; i++) {
            int temp = ways[1];
            ways[1] += ways[0];
            ways[0] = temp;
        }
        return ways[1];
    }
}