题解 | #N阶楼梯上楼问题#
N阶楼梯上楼问题
https://www.nowcoder.com/practice/c978e3375b404d598f1808e4f89ac551
#include <stdio.h> int main() { int num; scanf("%d",&num); int a[num]; a[0]=1;a[1]=2; for(int i=2;i<num;i++){ a[i]=a[i-1]+a[i-2]; } printf("%d",a[num-1]); }
每次决策的可行数目与之前的决策数相关a[i]=a[i-1]+a[i-2];