Remove elements
ID
27
Data Type
Sorting
Difficulty
Easy
Tags
Counting Sort
Naive Algorithm
Completed Date
Apr 28, 2024
Preference
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
be k
, to get accepted, you need to do the following things:- Change the array
nums
such that the firstk
elements ofnums
contain the elements which are not equal toval
. The remaining elements ofnums
are not important as well as the size ofnums
.
- Return
k
.
Custom Judge:
The judge will test your solution with the following code:
If all assertions pass, then your solution will be accepted.
Example 1:
Example 2:
Constraints:
0 <= nums.length <= 100
0 <= nums[i] <= 50
0 <= val <= 100