Java for LeetCode 070 Climbing Stairs

標籤：

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?

解題思路：

遞迴會導致逾時，用動態規劃即可，JAVA實現如下；

    public int climbStairs(int n) {        if(n==1)        return 1;        else if(n==2)        return 2;        int[] v=new int[n];        v[0]=1;        v[1]=2;        for(int i=2;i<v.length;i++)        v[i]=v[i-1]+v[i-2];        return v[n-1];    }

 

Java for LeetCode 070 Climbing Stairs