GoLang Solution For LeetCode Problem: Climbing Stairs
Solving Climbing Stairs in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Input: 2 Output: 2 Explanation: There are two ways to climb to the top. 1. 1 step + 1 step 2. 2 steps
Input: 3 Output: 3 Explanation: There are three ways to climb to the top. 1. 1 step + 1 step + 1 step 2. 1 step + 2 steps 3. 2 steps + 1 step
See the full details of the problem Climbing Stairs at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go