LeetCode 26: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.

给定一个已排序的数组，移除重复的元素并返回新数组的长度。

例如，给定nums = [1, 1, 2]

你的函数应该返回2，并且前两个元素为1和2。对于新数组长度以外的元素不作要求。

因为是已排好序的数组，因此只需顺序找到比前一个已排好的元素大的元素，然后放到它该放的位置即可。重点还是只扫一遍

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