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 < )
     {
         return numsSize;
     }

     int count = ;
     int j = ;
     int i;

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

 }

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

 int main()
 {
     int nums[] = { , , , , , , ,  };
     int numsSize = ;

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