Cracking the Coding Interview, 4 Edition - 150 Programming Interview Questions and Solutions

Solutions to Chapter 3 | Stacks and Queues
13 disks = new Stack();
14 index = i;
15 }
16
17 public int index() {
18 return index;
19 }
20
21 public void add(int d) {
22 if (!disks.isEmpty() && disks.peek() = 0; i--) {
39 System.out.println(“ “ + disks.get(i));
40 }
41 }
42
43 public void moveDisks(int n, Tower destination, Tower buffer) {
44 if (n > 0) {
45 moveDisks(n - 1, buffer, destination);
46 moveTopTo(destination);
47 buffer.moveDisks(n - 1, destination, this);
48 }
49 }
50 }
1 1 9
Cracking the Coding Interview | Data Structures