class Solution {
    public int[] deckRevealedIncreasing(int[] deck) {
        Deque<Integer> deque = new ArrayDeque<>();
        Arrays.sort(deck);
        for(int i=deck.length-1; i>=0; i--){
            if(deque.isEmpty()){
                deque.offer(deck[i]);
            }else{
                deque.offerFirst(deque.pollLast());
                deque.offerFirst(deck[i]);
            }
        }
        int ans[] = new int[deque.size()];
        for(int i=0; i<ans.length; i++){
            ans[i]=deque.poll();
        }
        return ans;
    }
}