Sort Numbers With Two Stack (Many Duplicates)

public class Solution {
  public void sort(LinkedList<Integer> stack1) {
         LinkedList<Integer> stack2 = new LinkedList<Integer>();
      int min = Integer.MAX_VALUE;
      int counter = 0;
      int size2 = 0;

      while (stack1.size() > 0) {
        while (!stack1.isEmpty()) {
          int top = stack1.pop();
          if (top == min) {
            counter++;
            continue;
          } else if (top < min) {
            for (int m = 1; m <= counter; m++) {
              stack2.push(min);            // Re-add previous smallest number to stack2
            }
            min = top;                        //Reset counter and min
            counter = 1;
          } else {
            stack2.push(top);
          }
        }

        while (!stack2.isEmpty() && stack2.size() > size2) {     // shuffle elements from stack2 back to stack1;
          stack1.push(stack2.pop());
        }

        for (int j = 1; j <= counter; j++) {
          stack2.push(min);
        }
        min = Integer.MAX_VALUE;
        size2 = stack2.size();
        counter = 0;            // <-- 忘记重新初始化了！！！！！
      }

      while(!stack2.isEmpty()) {
        stack1.push(stack2.pop());
      }
  }
}