[Leetcode] 26、Remove Duplicates from Sorted Array（从有序数组中删除重复项）题解

Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

Example 1:

Given 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 returned length.
Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

It doesn’t matter what values are set beyond the returned length.
Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

Internally you can think of this:

// nums is passed in by reference. (i.e., without making a copy)
int len = removeDuplicates(nums);

// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
    print(nums[i]);
}

题目解析：这道题目要求我们去除有序数组中重复的数字，使数组中的每一个数字元素只出现一次，返回的是改变后数组的长度。

思路：1、我们通过设置两个指针，一个快指针，一个慢指针，当出现数据相等的情况，快指针向后移动，慢指针不变，不等时，快慢指针均向后移动。

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if(nums.empty()) return 0;
        int pre=0,cur=0,n=nums.size();
        //快慢指针，快指针为cur,慢指针为pre
        while(cur<n){
            if(nums[pre]==nums[cur])++cur;
            //如果存在前后相等，则只让当快指针向后移动，不移动慢指针
            else nums[++pre]=nums[cur++];
            //否则均向后移动
            
        }
        
        return pre+1;
    }
};

2、利用vector中的函数erase，来删除出现的重复数字。

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