LeetCode 70: Climbing Stairs
Problem Restatement We are given an integer n . There is a staircase with n steps. Each time, we may climb either: 1 step 2 steps We need to return how many distinct ways there are to reach the top. The official constraint is 1 <= n <= 45 . ( leetcode.com ) Input and Output Item Meaning Input An integer n Output Number of distinct ways to reach step...