title: how to construct a class that requires a non-constant amount of heaps
body: <p>the program input in String[] args will look like this 123 0 0 where each rod of the hanoi tower is seperated by a space and each 1-digit integer represents a disk of that size.</p>
  
  <p>How do I make a class of HanoiState that allows me to save the current state that is given as input, and make it so that moving any disk at the top of a rod, in this case it's "1", from one rod to the one adjacent to it is simple.</p>
  
  <p>The command line prompt examples: $java hanoi 123 0 0 or $java hanoi 12 0 4 0</p>
  
  <p>I was thinking of constructing n amount of priority queues for n amount of rods after parsing the input. However, the number of rods is not constant and I'm not sure how to code this.</p>
  
  <p>Is it also possible to construct an array of priority queues? or a list of priority queues?</p>
  
  <pre><code>public static class HanoiState {
      public HanoiState(int rods){
  
      }
  }
  
   public static void main(String[] args) {
      if (args.length &lt; 3) {
          return;
      }
      HanoiState a = new HanoiState(args.length - 1);
  </code></pre>