[Leetcode] climbing stairs

Source: Internet
Author: User

You are climbing a stair case. It takesNSteps 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?


DP enlightened. After finishing this question, I finally got a rough idea of DP. I checked the table from the bottom up and it would be okay after the table is created. The complexity is O (n)

void iter(int acc, int n, vector<int> &table) {    if (acc < 0) return;    if (acc == n+1) return;    int a = acc-1 < 0? 0 : acc-1;    int b = acc-2 <0? 0 : acc-2;    table.push_back(table[a] + table[b]);    iter(acc+1, n, table);}int climbStairs(int n) {    vector<int> table;    table.push_back(0);    table.push_back(1);    table.push_back(2);    if (n < 3) return table[n];    iter(3, n,table);    return table[n];}


A pure recursive version is provided. Of course it is TLE's

int climbstairs_TLE(int n) {    if (n == 1) return 1;    if (n == 2) return 2;    return climbstairs_TLE(n-1) + climbstairs_TLE(n-2);}


[Leetcode] 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.