26. Remove Duplicates from Sorted Array

标签：app   his   move   code   ace   bsp   ext   strong   size   

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.

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

26. Remove Duplicates from Sorted Array

标签：app   his   move   code   ace   bsp   ext   strong   size   

原文地址：https://www.cnblogs.com/vegg117/p/9351226.html