Given an array nums and a value val, remove all instances of that value in-place and return the new length.
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
给定数组nums和值val,在适当位置删除该值的所有实例并返回新长度。
不要为另一个数组分配额外的空间,你必须这样做修改输入数组就地用O(1)额外的内存。
元素的顺序可以改变。你留下的新长度并不重要。
思路:其实就是存下来需要的数字,然后放到原来的数组前面就可以了
public int removeElement(int[] nums, int val) {
int count = 0;
ArrayList<Integer> arr = new ArrayList<Integer>();
for (int i = 0; i < nums.length; i++) {
if(nums[i]!=val){
count++;
arr.add(nums[i]);
}
}
for (int i = 0; i < arr.size(); i++) {
nums[i] = arr.get(i);
}
return count;
}