In this Leetcode Remove Element problem solution we have given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed.

Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.

Return k after placing the final result in the first k slots of nums. Do not allocate extra space for another array. You must do this by modifying the input array in place with O(1) extra memory.

Leetcode Remove Element problem solution


Problem solution in Python.

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        c = 0
        n=len(nums)
        for i in range(1,n):
            if(nums[i]==nums[i-1]):
                c+=1
            else:
                nums[i-c]=nums[i]
        return(n-c)



Problem solution in Java.

class Solution {
    public int removeElement(int[] nums, int val) {
        int start = -1;
        for(int i = 0; i < nums.length; ++i) {
            if(nums[i] != val) {
                nums[++start] = nums[i];
            }
        }
        
        return start + 1;
    }
}


Problem solution in C++.

public class Solution {
    public int removeElement(int[] nums, int val) {
        int idx = 0;
        for (int i = 0; i < nums.length; i++){
            if (nums[i] != val){
                nums[idx++] = nums[i]; 
            }
        }
        return idx;
    }
}


Problem solution in C.

int removeElement(int* nums, int numsSize, int val){
    int count=0,temp;
    for(int i=0;i<numsSize;i++)
    {
        if(nums[i]!=val)
        {
            temp=nums[i];
            nums[i]=nums[count];
            nums[count]=temp;
            count++;
        }
    }
    return count;
}