有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

>>阅读原文<<