Leetcode Remove Duplicates from Sorted Array

26、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.

分析：

给定一个排好顺序的序列，去除重复的数字后，输出新序列的长度

C++实现：

这里提供两种解决方案，这个问题比较简单，可以直接对数组进行移动，也可以使用STL
方法一：

class Solution {public:    int removeDuplicates(vector<int>& nums) {        if(nums.empty())            return 0;        int index = 0;        for(int i = 1;i < nums.size(); ++i){            if(nums[index] != nums[i])            nums[++index] = nums[i];        }        return index+1;    }};

方法二：

class Solution {public:    int removeDuplicates(vector<int>& nums) {        return distance(nums.begin(), unique(nums.begin(), nums.end()));    }};

知识点：distance():用于求出迭代器之间的距离

python实现：

class Solution(object):    def removeDuplicates(self, nums):        """        :type nums: List[int]        :rtype: int        """        if len(nums) <= 1:            return len(nums)        index = 0        for i in xrange(1, len(nums)):            if nums[i] != nums[index]:                slow += 1                nums[index] = nums[i]        return index + 1