Remove Element,Remove Duplicates from Sorted Array,Remove Duplicates from Sorted Array II

以下三个问题的典型的两个指针处理数组的问题，一个指针用于遍历，一个指针用于指向当前处理到位置

一：Remove Element

Given an array and a value, remove all instances of that value in place and return the new length.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int i = ;
        int n = nums.size();

        while(i<n){
            if(nums[i]==val){
                swap(nums[i],nums[--n]);
            }else{
                ++i;
            }
        }

        nums.erase(nums.begin()+i,nums.end());
        return nums.size();
    }
};

二：Remove Duplicates from Sorted Array

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.

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int numsSize = nums.size();
        int j=;
        int repeat = ;
        for(int i=;i<numsSize;i++){
            if(i==){
                j=;
                repeat = nums[i];
            }else{
                if(nums[i]!=repeat){
                    nums[j++] = nums[i];
                    repeat = nums[i];
                }
            }
        }
        for(int i=numsSize-;i>=j;i--){
            nums.erase(nums.begin()+i);
        }
        return j;
    }
};

三：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.

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int numsSize = nums.size();
        int j=;
        int repeat = ;
        int repeatTime = ;
        for(int i=;i<numsSize;i++){
            if(i==){
                j=;
                repeat = nums[i];
                repeatTime = ;
            }else{
                if(nums[i]!=repeat){
                    nums[j++]=nums[i];
                    repeat = nums[i];
                    repeatTime = ;
                }else if(repeatTime < ){
                    nums[j++]=nums[i];
                    repeatTime ++;
                }
            }
        }
        for(int i=numsSize-;i>=j;i--){
            nums.erase(nums.begin()+i);
        }
        return j;
    }
};