题解 | Head and Tail of the Queue
Head and Tail of the Queue
https://www.nowcoder.com/practice/4acc8bb985b84b68b935ce26c8f4d1b9
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;
}
}
}
}
汤臣倍健开奖26人在聊
哔哩哔哩公司氛围 218人发布
