Given an array and a value, 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 in place with constant memory.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
Example:
Given input array nums = [3,2,2,3]
, val = 3
Your function should return length = 2, with the first two elements of nums being 2.
思路:两个指针,一个指向current,一个往后指,遇见不是val的时候,copy到current,然后继续走,直到走完就可以了,返回current。
class Solution {
public int removeElement(int[] nums, int val) {
int i = 0;
int j = 0;
while(j < nums.length) {
if(nums[j] != val) {
nums[i++] = nums[j];
}
j++;
}
return i;
}
}