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.

/*************************************************************************
    > File Name: LeetCode080.c
    > Author: Juntaran
    > Mail: JuntaranMail@gmail.com
    > Created Time: Tue 17 May 2016 20:54:02 PM CST
 ************************************************************************/

/*************************************************************************
    
    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.

 ************************************************************************/

#include <stdio.h>

int removeDuplicates(int* nums, int numsSize)
{
    if(numsSize < 2)
    {
        return numsSize;
    }

    int count = 1;
    int j = 1;
    int i;

    for( i=1; i<numsSize; i++ )
    {
        if( nums[i] == nums[i-1] )
        {
            count ++;
            if( count < 3 )
            {
                nums[j++] = nums[i];
            }
            else
            {
                printf("***
");
            }
            printf("i=%d j=%d nums[i]=%d nums[j]=%d
", i,j,nums[i],nums[j]);
            printfNums(nums,numsSize);
        }
        else
        {
            nums[j++] = nums[i];
            count = 1;
            printf("i=%d j=%d nums[i]=%d nums[j]=%d
", i,j,nums[i],nums[j]);
            printfNums(nums,numsSize);
        }
    }
    return j;

}

void printfNums( int* nums, int numsSize )
{
    int i;
    for( i=0; i<numsSize; i++ )
    {
        printf("%d ", nums[i]);
    }
    printf("
");
}

int main()
{
    int nums[] = { 1, 2, 3, 3, 3, 5, 5, 5 };
    int numsSize = 8;

    int ret = removeDuplicates( nums, numsSize );
    printf("%d
", ret);
}