ThinkerQAQ

递归

Data Structures & Algorithms · 3 notes

  1. Jump Floorhistorical

    Use the Fibonacci recurrence to calculate the number of ways a frog can climb the stairs.

  2. Jump Floor IIhistorical

    Derive the number of ways to climb stairs when each jump may cover any number of steps using a recurrence and a pattern.

  3. Fibonacci Sequencehistorical

    Record three implementations of the Fibonacci sequence: recursion, memoization, and dynamic programming.