Link

点击打开题目链接

Problem

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.

Mean

给你一个排序好的数组,让你删除重复的数字。

Analysis

这道题只能使用O(N)复杂度的算法,因为数组是排序好的,这样扫一遍只保留唯一的元素即可。

C++ Code

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

欢迎留言