[C语言][LeetCode][26]Remove Duplicates from Sorted Array

题目

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.

标签

Array、Two Pointers

难度

简单

分析

题目意思是给定一个排好序的整型数组，去除数组里的重复数字，每个数字只能出现一次，并且不能为其他数组申请额外的内存，只能在同一个数组里操作。我的做法是用一个count计算新数组的大小，然后判断前后两个整形是否相同，如果不等，那就将后面那个整形，存放到nums[count]里。

C代码实现

int removeDuplicates(int* nums, int numsSize) {
    int i = 0;
    int count = 0;

    for(i=0; i<numsSize-1; i++)
    {
        if(nums[i] != nums[i+1])
        {
            count++;
            nums[count] = nums[i+1];
        }
    }

    if(0 == numsSize)
        return count;
    else
        return count+1;
}