网易笔试第二题，帮忙看看有没有错，提交的算法才50%

//这个是最后几秒才想出来的，不够时间了，提交的复杂度太大
import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int num = in.nextInt();
        int[] arr1=new int[num];
        int[] arr2=new int[num];
        int count = 0;
        while (in.hasNextInt()) {//注意while处理多个case
            int b = in.nextInt();
            arr1[count] = b;
            ++count;
        }
        int j = 0;
        if(num % 2 == 0) {
        	for(int i=count-1;i>=0;i=i-2) {
        		arr2[j++] = arr1[i];
        	}
        	for(int i=0;i<count-1;i=i+2) {
        		arr2[j++] = arr1[i];
        	}
        } else{
        	for(int i=count-1;i>=0;i=i-2) {
        		arr2[j++] = arr1[i];
        	}
        	for(int i=1;i<count-1;i=i+2) {
        		arr2[j++] = arr1[i];
        	}
        }
        for(int i=0; i< count;++i) {
        	System.out.print(arr2[i]);
        	if(i != count-1) {
        		System.out.print(" ");
        	}
        }
        
    }
}