80. Remove Duplicates from Sorted Array II

In this problem, we are tasked with removing duplicate elements from a sorted array while allowing at most two occurrences of each element to remain. To achieve this, we can utilize a two-pointer approach where one pointer (k) is used to keep track of the position where the next non-duplicate element should be placed. We also maintain a count of the occurrences of the current element (lcount) and update it accordingly as we iterate through the array.

public class Solution {
    public int RemoveDuplicates(int[] nums) {
        int lcount = 1;
        int last = nums[0];
        int k = 1;
        for(int i = 1; i<nums.Length; i++) {
            lcount = last == nums[i]? lcount + 1 : 1;
            if(lcount <= 2) nums[k++] = nums[i];
            last = nums[i];
        }
        return k;
    }
}