C language leetcode deleting duplicate items in an ordered array

To give you one Ascending order Array of nums , Would you please In situ Delete duplicate elements , Make each element Only once , Returns the new length of the deleted array . Elemental Relative order It should be maintained Agreement .

Because the length of an array cannot be changed in some languages , So you have to put the result in an array nums The first part of . More formally , If there is... After deleting duplicates k Elements , that nums Before k An element should hold the final result .

Insert the final result into nums Before k Return to... After a position k .

Don't use extra space , You must be there. In situ Modify input array And using O(1) Complete with extra space

int removeDuplicates(int* nums, int numsSize){
    if(numsSize==0)
    {
        return 0;
    }
    int quick = 1;
    int con = 1;
    while(quick<numsSize)
    {
        if(nums[quick-1]!=nums[quick])
        {
            nums[con]=nums[quick];
            con++;
        }
        quick++;
    }
    return con;
}

  Code placed github: stay c_dailywork in

https://github.com/frankRenlf/c_dailyWork.githttps://github.com/frankRenlf/c_dailyWork.git

 

In this folder