【LeetCode】080. Remove Duplicates from Sorted Array II

题目：

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

For example,
Given sorted array nums = [1,1,1,2,2,3],

Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn't matter what you leave beyond the new length.

题解：

Solution 1

class Solution {

public:

    int removeDuplicates(vector<int>& nums) {

        int k = ;

        int n = nums.size();

        if(n < )

            return n;

        int index = , cnt = ;

        for(int i = ; i < n; ++i){

            if(nums[i] != nums[index]){

                cnt = ;

                nums[++index] = nums[i];

            } else if(++cnt <= k){

                nums[++index] = nums[i];

            }

        }

        return index + ;

    }

};

Solution 2

class Solution {

public:

    int removeDuplicates(vector<int>& nums) {

        int k = ;

        int n = nums.size();

        if(n < k)

            return n;

        int index = k;

        for(int i = k; i < n; ++i){

            if(nums[i] != nums[index - k])

                nums[index++] = nums[i];

        }

        return index;

    }

};

此解与Remove Duplicates from Sorted Array相似

巴特西

【LeetCode】080. Remove Duplicates from Sorted Array II

最新文章

热门文章