标签：c++ algorithm leetcode 动态规划
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?
标签：c++ algorithm leetcode 动态规划
原文地址：http://blog.csdn.net/wangyaninglm/article/details/45369627
