网易笔试在线编程_ 操作序列

方法一：

import java.util.Deque;
import java.util.LinkedList;
import java.util.Scanner;

public class Main {


	public static void main(String[] args) {
		int n;
		int str[] = null;
		Scanner scanner=new Scanner(System.in);
		n=scanner.nextInt();
		str=new int[n];
		for(int i=0;i<n;i++){
			str[i]=scanner.nextInt();
		}
		
		Deque<Integer> subway=new LinkedList<Integer>();
		if(n%2!=0){
			for(int i=0;i<n;i++){
				if(i%2==0)
					subway.offerFirst(str[i]);
				else
					subway.offerLast(str[i]);
				}
		}else{
			for(int i=0;i<n;i++){
				if(i%2==0)
					subway.offerLast(str[i]);
				else
					subway.offerFirst(str[i]);
				}
		}	
		for(int i=0;i<n;i++){
            if(i!=n-1){
                System.out.print(subway.pollFirst()+" ");
            }else{
                System.out.print(subway.pollFirst());
            }
		}
	}
}

方法二：