九度OJ―题目1205:N阶楼梯上楼问题 (非递归)

2015-01-25 07:49:27 · 作者: · 浏览: 5

\

题目描述:

N阶楼梯上楼问题:一次可以走两阶或一阶,问有多少种上楼方式。(要求采用非递归)<??http://www.2cto.com/kf/ware/vc/" target="_blank" class="keylink">vcD4KCjxzdHJvbmc+yuTI66O6PC9zdHJvbmc+IAo8cD7K5MjrsPzAqNK7uPbV+8r9TiwoMTw9Tjw5MCmhozwvcD4KCjxzdHJvbmc+yuSz9qO6PC9zdHJvbmc+IAo8cD6/ycTc09C24NfpsuLK1Mr9vt2jrLbU09rDv9fpyv2+3aOsPGJyPgrK5LP2tbHCpczdvdfK/crHTsqxtcTJz8Klt73Kvbj2yv2hozwvcD4KCjxzdHJvbmc+0fnA/crkyOujujwvc3Ryb25nPiAKPHByZSBjbGFzcz0="brush:java;">

4 样例输出:

5
来源: