Easy 7 Remove Duplicates from Sorted Array（26）

Description
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.
Solution
类似与插入排序，依次检索不同的数插入到前面。

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