Algorithm: Climb Stairs

Question:

 

If you are only able to climb some stairs with 1,2 or 3 steps in each time, how many possibilities you have when you climb 10 stairs? Please display all the possibilities.

 

Codes:

 

 

Analysis:

1. We need a array to store each count of step we move. Obviously, the max of the array size should be the length of stairs. In my example, the array is step[].

2. We also need a var to mark the position of step[] so that we can know what time we have moved.

3. Var Count is used to record how many possibilities we have got in totally.

4. Now see func climb(N):

Suppose that we climbed 1 step in first time. Then, we can store 1 to the step[0]. Obviously, index is 0 at here. After that we still have N-1 steps need to climb. So, we have to invoke recursion which is stated as climb(N-1) to repeat these operations. 

However, what if we want to climb 2 steps or 3 steps in first time?  In order to travel all the possibilities, we have to go back to previous step and re-climb with the number of new step. Base on this idea, we can make index=index-1 to go back to previous step and store 2 or 3 to step[index]  and keep index moving with index++. Likewise, we need to invoke climb(N-1) to climb the rest of steps.

At last, when the steps we have climbed is 0, that means we have already finished to climb. So we can stop recursion invoking and output array step to display one of Moving Solution. Since this is a recursion calling, we will get all the possibilities.

 

Result:

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

yexianyi

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值