问返回堆栈的最小值

EN

public static CalendarDate removeMin(Stack<CalendarDate> stack) {
        Queue<CalendarDate> aux = new LinkedList<CalendarDate>();
        CalendarDate min = stack.peek();
        if(stack.size() < 1) {
            return null;
        }

        while (!stack.empty()) {
            CalendarDate c = stack.pop();
            aux.add(c);
            if(c.compareTo(min) == -1) {
                min = c;
            }
            aux.add(c);
        }

        while (!aux.isEmpty()) {
            if (aux.remove().compareTo(min) == 1) {
                stack.push(aux.remove());
            }
        }

        while (!stack.empty()) {
            aux.add(stack.pop());
        }

        while (!aux.isEmpty()) {
            stack.push(aux.remove());
        }

        return min;

    }

public static void main(String[] args) {
        // store some dates so they can be reused
        CalendarDate[] store = {new CalendarDate(1,2,10), new CalendarDate(1,1,10), new CalendarDate(12,30,10)};
        Stack<CalendarDate> testAll = new Stack<CalendarDate>();
        for (CalendarDate i: store) {
            testAll.push(i); // build a Stack
        }
        for (int i = 1;i <= 9;i++) {
            testAll.push(new CalendarDate(1,1,10));
        }
        System.out.println(Chapter14.removeMin(testAll));
    }