#26 Remove Duplicates from Sorted Array

标签：leetcode   c   array   two pointers   

题目链接：https://leetcode.com/problems/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.

int removeDuplicates(int* nums, int numsSize) {
    if(numsSize <= 1)                   //如果少于一个元素，没有重复元
        return numsSize;
    int index = 0;                      //标记删除重复元后的最后一个元素下标
    for(int i = 1; i < numsSize; ++i)   //遍历数组，如果当前元素与前一个不相同，加入到已处理数组中
        if(nums[i] != nums[index])
            nums[++index] = nums[i];    //删除后的数组永远小于原来数组，所以可以直接在原数组上储存
    return index + 1;
}

#26 Remove Duplicates from Sorted Array

标签：leetcode   c   array   two pointers   

原文地址：http://blog.csdn.net/ice_camel/article/details/46956133