DSA problem
Remove Element
Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val.
Consider the number of elements in nums which are not equal to val to be k. To be accepted, your solution must do the following:
- Change the array
numssuch that the firstkelements ofnumscontain the elements which are not equal toval. The remaining elements ofnumsare not important, as well as the size ofnums. - Return
k.
The judge will verify the first k elements of your modified array, so allocating a separate output array is not allowed.
Examples
Example 1
Input:
nums = [3,2,2,3], val = 3Output:
2, nums = [2,2,_,_]Explanation: Your function should return k = 2, with the first two elements of nums being 2. It does not matter what you leave beyond the returned k.
Example 2
Input:
nums = [0,1,2,2,3,0,4,2], val = 2Output:
5, nums = [0,1,4,0,3,_,_,_]Explanation: Your function should return k = 5, with the first five elements of nums containing 0, 0, 1, 3, and 4 in any order.
Constraints
- 0 <= nums.length <= 100
- 0 <= nums[i] <= 50
- 0 <= val <= 100
3 hints and a full solution walkthrough with step-by-step visualizations are available in the practice editor.