Leetcode | | 70, Climbing stairs

Source: Internet
Author: User

Problem:

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?

Hide TagsDynamic ProgrammingTest instructions: Climb up an n-step staircase, crawl one or two orders at a time, and find out how many different ways to get there

Thinking:

(1) To tell the truth, see the first reaction to the use of DFS, but the time complexity of the deep search for the number of linear expression of the solution, will definitely time-out

(2) The hint uses the DP, the time complexity is O (n), this problem's state transfer equation is very simple: a[i]=a[i-1]+a[i-2]; the only problem is initialization: a[0]=1,a[1]=2

Submitting a trial correction is.

Code

Class Solution {public:    int climbstairs (int n) {        vector<int> a (n,0);        A[0]=1;        a[1]=2;        if (n<3)            return a[n-1];        for (int i=2;i<n;i++)            a[i]=a[i-1]+a[i-2];        return a[n-1];}                ;


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.