有n步台阶，一次只能上1步或2步，问共有多少种走法？

递归实现 public static long OneStepOrTwoStepSolution(int num) { if(num == 1 || num ==2) { return num; } return OneStepOrTwoStepSolution(num-1)+OneStepOrTwoStepSolution(num-2); } 迭代实现 public static l

>>阅读原文<<