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.

题意：不能借助内存空间，就是说哈希表不能用，只能在数组内操作；

思路：首先选取数组第一位数，将该数与数组后的数比较，若不相等，则赋值到i+1,位置，使i+1,选取第二位比较，以此循环...最后返回 i+1(长度);

int removeDuplicates(int* nums, int numsSize) {
    if(numsSize==0) return 0;
    int i = 0;  
    for(int j = 1;j<numsSize;j++){  
        if(nums[j]!=nums[i]){   //从nums数组后面查找元素是否相等，不相等则赋值给nums[];
            i++;
            nums[i]=nums[j];
        }
    }
    return i+1;
}

 

转载于:https://www.cnblogs.com/linwx/articles/7672652.html