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.
Your function should return length = 2, with the first two elements of nums being 2.
It doesn’t matter what you leave beyond the returned length.
Almost same with previous challenge LeetCode: Remove Duplicates from Sorted Array.
Iterate all the elements of input array, with a extra
cnt to track the length of result array.
Time complexity: $O(N)$
If we use the
std::remove, the code will be much shorter.
Preparing for an interview? Check out this!