This content originally appeared on DEV Community and was authored by Simona Cancian
The problem is as follows:
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
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.
Custom Judge:
The judge will test your solution with the following code:
int[] nums = [...]; // Input array
int val = ...; // Value to remove
int[] expectedNums = [...]; // The expected answer with correct length.
// It is sorted with no values equaling val.
int k = removeElement(nums, val); // Calls your implementation
assert k == expectedNums.length;
sort(nums, 0, k); // Sort the first k elements of nums
for (int i = 0; i < actualLength; i++) {
assert nums[i] == expectedNums[i];
}
If all assertions pass, then your solution will be accepted.
Example 1:
Input: nums = [3,2,2,3], val = 3
Output: 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 (hence they are underscores).
Example 2:
Input: nums = [0,1,2,2,3,0,4,2], val = 2
Output: 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.
Note that the five elements can be returned in any order.
It does not matter what you leave beyond the returned k (hence they are underscores).
Here is how I solved it:
To solve this problem, I used two main strategies:
-
In-place Replacement: Instead of creating a new array to store the elements that are not equal to
val, use the same arraynumsto overwrite the elements that need to be removed. -
Two-pointer Technique: One pointer (
i) iterates through each element in the array, and another pointer (k) keeps track of the position where the next non-val element should be placed.
- First, initialize a pointer
kand set it to 0. This will keep track of the position where the next non-val element should be placed.
class Solution:
def removeElement(self, nums: List[int], val: int) -> int:
k = 0
- Iterate through nums array.
- Check if the current element nums[i] is different from val to keep track of k.
- If it is, move element nums[i] to the k-th position, and increment k by 1 to update the position for the next non-val element.
for i in range(len(nums)):
if nums[i] != val:
nums[k] = nums[i]
k += 1
- Return k, which is the number of elements not equal to val.
return k
Here is the completed solution:
class Solution:
def removeElement(self, nums: List[int], val: int) -> int:
k = 0
for i in range(len(nums)):
if nums[i] != val:
nums[k] = nums[i]
k += 1
return k
This content originally appeared on DEV Community and was authored by Simona Cancian
Simona Cancian | Sciencx (2024-07-09T02:10:40+00:00) Leetcode Day 8: Remove Element Explained. Retrieved from https://www.scien.cx/2024/07/09/leetcode-day-8-remove-element-explained/
Please log in to upload a file.
There are no updates yet.
Click the Upload button above to add an update.