26. Remove Duplicates from Sorted Array（easy）

题目

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) {      int count = 0;      int n=nums.size();            for(int i=1;i<n;i++){          if(nums[i]==nums[i-1])   count++;          nums[i-count]=nums[i];      }      return n-count;    }};