LeetCode 26. Remove Duplicates from Sorted Array(删除排序数组中的重复项) -- C语言

26. Remove Duplicates from Sorted Array

Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

Example 1:

Given 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 returned length.

Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5 , with the first five elements of nums being modified to 0 , 1 , 2 , 3 , and 4 respectively.

It doesn't matter what values are set beyond the returned length.

解题思路：

分新数组区和待处理区，当前元素和前一个元素相同时，直接处理下一个元素，不同时，将元素赋值到新数组区最后（即k下标所指位置。

//执行用时 : 20 ms, 在Remove Duplicates from Sorted Array的C提交中击败了97.10% 的用户
//内存消耗 : 9.6 MB, 在Remove Duplicates from Sorted Array的C提交中击败了74.98% 的用户

int removeDuplicates(int* nums, int numsSize){
    int i = 1,k = 1;
    //i为工作下标，k为新数组长度
    if(numsSize == 0){
        return 0;
    }
    while(i < numsSize){
        if(nums[i] == nums[i-1]){
            //和前一个相等时，直接后移
            i++;
        }
        else{
            //不相等时交换到新数组末尾
            nums[k] = nums[i];
            k++;
            i++;
        }
    }//while
    
    return k;//返回新数组长度
}

后记：

将排序数组改为i无序数组：