Climbing Stairs_爬楼梯_递归

/*这个程序其实是用C写的_CB*/

/*刚才在博客上看到有人解决了这个问题，明天就考试了，拿着个练练递归撒*/

/*question:if your can make 1 or 2 steps once, in unknown stairs way, what the number of solution are?*/

<span style="font-family: Arial, Helvetica, sans-serif;">#include<stdio.h></span>

int solu = 0;

void main(){int way;printf("way=\n");scanf("%d", &way);int solution(int all);solution(way);printf("solution=%d", solu);}

/*递归*/int solution(int all){if (all == 0){solu++;}else{if (all != -1){solution(all - 1);solution(all - 2);}else{return 0;}}

}

//链接是原博主解决方法