网易Android第二题，插入并反转n次数组那道题，内存溢出

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {
            int n = in.nextInt();
            int[] b = new int[n];
            int i = n >> 1;
            int j = i+1;
            b[i--] = in.nextInt();
            while (true) {
                if (i < 0) break;
                b[i--] = in.nextInt();
                if (j >= n) break;
                b[j++] = in.nextInt();
            }
            if (n%2==0){
                for (int k = 0; k < n - 1; k++) {
                    System.out.print(b[k] + " ");
                }
                System.out.println(b[n - 1]);
                continue;
            }else{
                for (int k = n-1; k >0; k--) {
                    System.out.print(b[k] + " ");
                }
                System.out.println(b[0]);
                continue;
            }
        }
    }
}