关闭

70. Climbing Stairs

150人阅读 评论(0) 收藏 举报
分类:

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?

public class Solution {
    public int climbStairs(int n) {
        if (n == 0 || n == 1)
      return 1;
    int pre = 1;
    int current = 1;
    for (int i = 2; i <= n; i++) {
      int temp = current + pre;
      pre = current;
      current = temp;
    }
    return current;
    }
}

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:72530次
    • 积分:1480
    • 等级:
    • 排名:千里之外
    • 原创:79篇
    • 转载:9篇
    • 译文:0篇
    • 评论:13条
    最新评论