Title Description

Click the direct topic link
26. Remove duplicate items from an ordered array

Their thinking

We use two subscripts i,j marked .i Traverse the array ,j Used for and i Compare the corresponding numbers . Move at different times .
How to play it ：
i,j Start with the matching search , When i,j Number of points equal when ,i Move ,j Immobility . When i and j Number of points It's not equal when ,j Move a bit , And then put i The corresponding value is overwritten to j Corresponding value , next i Move again . until i Traverse the entire array .

Code

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