leetcode-26&80 Remove Duplicates from Sorted Array I & II

26 Remove Duplicates from Sorted Array I

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：使用stl给出的vector的erase函数

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

方法2：注意到这句话：“  It doesn't matter what you leave beyond the new length.”，因此将非重复元素向前挪。

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

80. Remove Duplicates from Sorted Array II

Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?

第二种方法不好使了，还是使用stl好了，没怎么多想。

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