public class StageClimbTest { private static void stageClimb(Stack<Integer> stack, int N){ if(N>=1){ stack.push(1); stageClimb(stack, N - 1); stack.pop(); } if(N>=2){ stack.push(2); stageClimb(stack, N-2); stack.pop(); } if (N>=3){ stack.push(3); stageClimb(stack, N-3); stack.pop(); } if (N == 0){ for (Integer i : stack){ System.out.print(i + ","); } System.out.println(); } } public static void main(String[] args){ int n = 10; Stack<Integer> stack = new Stack<Integer>(); stageClimb(stack, n); } }
爬楼梯算法备份
最新推荐文章于 2022-07-12 17:42:17 发布