爬台阶问题(每一次爬一阶台阶,或者每一次爬二阶台阶)

package 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?*/ //为了节省程序的时

>>阅读原文<<