leetcode刷题日记——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) {        if(nums.size()==0) return 0;        int temp=nums[0];        int flag=1;        for(int i=1;i<nums.size();i++){            if(nums[i]==temp) continue;            nums[flag++]=nums[i];            temp=nums[i];        }        return flag;    }};