Write a method removeOddPositions that removes
the values in odd-numbered positions (if any) from a list of integers. For
example if a variable called list stores these values:
[8, 13, 17, 4, 9, 12, 98]
and the following call is made:
list.removeOddPositions();
The list should store this sequence after the call:
[8, 17, 9, 98]
The method removed the values at odd positions (positions 1, 3, and 5),
otherwise preserving the order of the remaining elements. Notice that it
doesn't matter whether the value itself is odd or even but instead whether
it appears in an odd position or even position.
You are writing a method for the ArrayIntList class discussed in lecture:
public class ArrayIntList {
private int[] elementData; // list of integers
private int size; // current # of elements in the list
<methods>
}
You may not call any other methods of the ArrayIntList methods to solve this
problem, you are not allowed to define any auxiliary data structures (no
array, ArrayList, etc), and your solution must run in O(n) time.