leetCode26 Remove Duplicates from Sorted Array(移除多余的重复数组元素)

26. Remove Duplicates from Sorted Array

Description

Given a sorted array, remove the duplicates in place such that each element appear onlyonce 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 ofnums being 1 and 2 respectively. It doesn't matter what you leave beyond the new length.

由于返回值是数组去重后元素的个数，所以最终的结果是0-iterator-1的数组元素，需要对数组进行处理，交换对于大数组显然是不适合的，所以利用赋值操作。

int removeDuplicates(int* nums, int numsSize) {
    int iterator=1,j=0;
    if(numsSize == 0 || numsSize == 1) return numsSize;
    for(j=1;j<numsSize;j++){
        if(nums[j] != nums[j-1])  {
           nums[iterator++]=nums[j];
        }else{
            continue;
        }
        
    }
    return iterator;
}