双指针算法Leetcode026删除排序数组的重复元素（Unique函数）、Leetcode027移除元素

地址

https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/submissions/
https://leetcode-cn.com/problems/remove-element/submissions/

描述

思想

删重代码

y总

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

自己

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

移除元素代码

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        sort(nums.begin(),nums.end());
        int k=0;
        for(int i=0;i<nums.size();){
            if(nums[i]!=val){
                nums[k++] =nums[i++];
            }
            else {
                i++;
            }
        }
        return k;
    }
};