As others have already mentioned, you cannot just remove the middle elements from an existing array. But you can however simply calculate the "beginning" and the "end" of the middle (if you want to call it like that) and then copy the left and the right part of the middle into a result array:
int middleStart = (myArr.length - 1) / 2;
int middleEnd = (myArr.length - 1) - middleStart;
int elementsToRemove = middleEnd - middleStart + 1;
int[] result = new int[myArr.length - elementsToRemove];
System.arraycopy(myArr, 0, result, 0, middleStart);
System.arraycopy(myArr, middleEnd + 1, result, middleStart, middleStart);
It might need some additional bounds checking but i don't think that there is any more efficient way to remove the middle element(s) of an array.