LeetCode 26

Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place
such that each element appear only once and return the new length.

Do not allocate extra space for another array,
you must do this in place with constant memory.

For example,
Given input array nums = [1,1,2],

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

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

/*************************************************************************
    
    Remove Duplicates from Sorted Array
    
    Given a sorted array, remove the duplicates in place 
    such that each element appear only once and return the new length.

    Do not allocate extra space for another array, 
    you must do this in place with constant memory.

    For example,
    Given input array nums = [1,1,2],

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

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

#include <stdio.h>

int removeDuplicates(int* nums, int numsSize) 
{
    int count = 0;
    int i;
    for( i=0; i<numsSize-1; i++ )
    {
        if( nums[i] == nums[i+1] )
        {
            count++;
        }
        else
        {
            nums[i+1-count] = nums[i+1];
        }
    }
    return numsSize-count;
}

int main()
{
    int nums[] = { 1, 2, 3, 3, 4, 5, 5, 5 };
    int numsSize = 8;
    
    int ret = removeDuplicates( nums, numsSize );
    printf("%d
", ret);
}