题解 | Head and Tail of the Queue

import java.util.ArrayDeque;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        ArrayDeque deque = new ArrayDeque();

        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()) {
            String name = scanner.next();
            // 初始化队列中的数据
            deque.offerLast(name);
        }

        // write your code here......
        boolean left = true;
        while(deque.size() > 0){
            if(left){
                System.out.println(deque.removeFirst());
                left = false;
            }else{
                System.out.println(deque.removeLast());
                left = true;
            }
        }

    }

}