Package g0001_0100.s0070_climbing_stairs

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    70 - Climbing Stairs.

    Easy

    You are climbing a staircase. It takes n steps to reach the top.

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

    Example 1:

    Input: n = 2

    Output: 2

    Explanation: There are two ways to climb to the top.

    • 1 step + 1 step

    • 2 steps

    Example 2:

    Input: n = 3

    Output: 3

    Explanation: There are three ways to climb to the top.

    • 1 step + 1 step + 1 step

    • 1 step + 2 steps

    • 2 steps + 1 step

    Constraints:

    • 1 <= n <= 45

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer climbStairs(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait