力扣26. 删除有序数组中的重复项

Posted 2021-06-28 幽殇默

题目地址

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

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