Climbing Stairs

Problem

You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

---

Idea

For each step i, step[i] = step[i-1]+step[i-2];

---

Solution

---