[Leetcode 70] Climbing stairs

Source: Internet
Author: User

You is climbing a stair case. It takes n steps to reach the top.

Each time you can either climb 1 or 2 steps. In what many distinct ways can you climb to the top?

Climb the stairs, you can be on one or two layers at a time, ask the N-level how many ways you share

F (n) =f (n-1) +f (n-2)

Rules, remember to save n-1 and n-2 results, the direct use of recursion will time out

AC Code

Class Solution {
Public
int climbstairs (int n) {
int count[n+1];
count[0]=0;
Count[1]=1;
count[2]=2;
if (n==1)
return 1;
if (n==2)
return 2;
for (int i=3;i<=n;++i)
COUNT[I]=COUNT[I-1]+COUNT[I-2];
return count[n];
}
};

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

[Leetcode 70] Climbing stairs

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.