LeetCode-Climbing Stairs

作者：disappearedgod

文章出处：http://blog.csdn.net/disappearedgod/article/details/30260023

时间：2014-6-12

题目

Climbing Stairs

  Total Accepted: 15056  Total Submissions: 45837 My Submissions

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?

解法

DP解法

不考虑优化的情况

public class Solution {
    public int climbStairs(int n) {
        if(n<2)
            return 1;
        int[] dp = new int[n];
        dp[0] = 1;
        dp[1] = 2;
        for(int i = 2 ; i< n; i++){
            dp[i] =dp[i-1] + dp[i-2];
        }
        return dp[n-1];
    }
}

时间

Submit Time	Status	Run Time	Language
3 minutes ago	Accepted	368 ms	java