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.
Example
Consideration
- we use two pointers pointing to the indexes. The first pointer points to the current index of the position to store the number not equaling to the target. The second pointer is used to iterate through the array.
Solution
Time Complexity: O(n), space complexity: O(1)
class Solution {
public int removeElement(int[] nums, int val) {
int cur = 0;
for(int i = 0; i < nums.length; i++) {
if(nums[i] != val)
nums[cur++] = nums[i];
}
return cur;
}
}