26. Remove Duplicates from Sorted Array&&27. Remove Element

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.

这道题我也是有点疑惑，leetcode最后运行的结果是返回一个vector……你逗我？

所以我就默认我自己对啦♪(^∇^*)

（讲真啊，难道不是返回长度就好了吗？）

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

然后听说进阶版是Remove element

Given an array and a value, 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 in place with constant memory.

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

Example:
Given input array nums = [3,2,2,3], val = 3

Your function should return length = 2, with the first two elements of nums being 2.

这题我看了下一般是两种解法

第一种是把所有不等于val的值从前往后排放，同时有一个idx计数，最后返回idx；

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

第二种是从前往后检测和val相等的值，如果发现和val相等呢，就把val替换成序列最后一个值。同时把序列最后一个值就丢掉辣。

一开始在想，那如果序列最后一个值刚好等于val怎么办！后来发现用while就行啦……反正会检测到不相等位置哒。

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