Leetcode 70: Climbing Stairs

The below is a very famous DP problem. You are climbing a staircase that has n steps. You can take the steps either 1 or 2 at a time. Calculate how many distinct ways you can climb to the top of the staircase. Example: for n=1, output = 1 for n=2, ou...