摘要：
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?Solution: Climd one step from last stair or climb 2 steps from the last last stair. 1 class Solution { 2 public: 3 int climbStairs(i... 阅读全文