[leetcode] 26.Remove Duplicates from Sorted Array & 27. Remove Element

本质上这两道题用的是同一种方法。设定一个temp下标表示更新过的数组元素下标，若符合题目要求，则将元素赋值给temp当前所在位置。最后返回temp。

26. Remove Duplicates from Sorted Array

Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

实现代码：（C++）

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

27. Remove Element

Given an array nums and a value val, remove all instances of that value in-place and return the new length.
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
The order of elements can be changed. It doesn’t matter what you leave beyond the new length.

实现代码：（C++）

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