Leetcode 80: Remove Duplicates from Sorted Array II

Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?

For example,
Given sorted array nums = [1,1,1,2,2,3],

Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn't matter what you leave beyond the new length.

 

Note: copied from others. It's a general solution.

 

public class Solution {
    public int RemoveDuplicates(int[] nums) {
        return RemoveKDuplicates(nums, 2);
    }
    
    private int RemoveKDuplicates(int[] nums, int k) {
        if (nums.Length <= k) return nums.Length;
        
        int i = 1, j = 1, count = 1;
        while (j < nums.Length)
        {
            if (nums[j] != nums[j - 1])
            {
                count = 1;
                nums[i++] = nums[j];
            }
            else if (count < k)
            {
                count++;
                nums[i++] = nums[j];
            }
            
            j++;
        }
        
        return i;
    }
}