Climbing Stairs
思路：动态规划
climb[n] = max(climb[n-1], climb[n-2]) climb[0] = 0 climb[1] = 1 climb[2] = 2
评价：应该是求和，没注意看。0没必要定义