We’re preparing your current view and syncing the latest data.
You are climbing a staircase that has n steps. Each time you can either climb 1 step or 2 steps. Your task is to determine in how many distinct ways you can climb to the top of the staircase.
An integer n representing the total number of steps in the staircase.
An integer representing the number of distinct ways to climb to the top.
1 <= n <= 45