您的位置:首页 > 大数据 > 人工智能

070 - Climbing Stairs

2015-12-30 16:45 447 查看
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?

int climbStairs(int n)
{
if (n <= 3) return n? n : 1;
int left = 2, right = 3, tmp;
int i;
for (i = 4; i <= n; i++) {
tmp = left + right;
left = right;
right = tmp;
}

return right;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: