LeetCode Algorithms #26 <Remove Duplicates from Sorted Array>

最新推荐文章于 2019-07-21 09:03:22 发布

NEUWYT

最新推荐文章于 2019-07-21 09:03:22 发布

阅读量262

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/neuwyt/article/details/51039687

版权

LeetCode 专栏收录该内容

37 篇文章 0 订阅

订阅专栏

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.

思路：

用两个迭代器，一个迭代器不断去寻找新的没重复的数，交给另一个迭代器，另一个迭代器每收到一个数递增1，然后当“跑的快”的迭代器跑到末尾时，说明没有新的数了。删除掉“跑的慢”的那个迭代器，到末尾的所有元素即可。

解：

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if(!nums.size())
            return 0;
        int temp = nums[0];
        auto it1 = nums.begin();
        auto it2 = nums.begin();
        
        while(true)
        {
            it1++;
            while(*it2 == temp && it2 != nums.end())
                it2++;
            if(it2 == nums.end())
                break;
            *it1 = *it2;
            temp = *it2; 
            
        }
        
        nums.erase(it1, nums.end());
        return nums.size();
    }
};