LeetCode-Array-26 Remove Duplicates from Sorted Array

问题：Givena sorted array, remove the duplicates in place such that each element appearonly once and return the new length.Do not allocate extraspace for another array, you must do this in place with constant memory.Forexample,Given
input array nums = [1,1,2],Your functionshould 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.

一个排好序的数组，删去重复出现的元素，不使用额外的存储空间。

思考：还是两个游标，i和j，如果后一个元素值与当前的不同，则将此值赋给j游标代表的值，同时使j加1。

代码：classSolution {

public:

   int removeDuplicates(vector<int>& nums) {

       int l=nums.size();

       int j=0;

       for (int i=0;i<l;i++)

       {

          if (i==0 || nums[i]!=nums[i-1]){

               nums[j]=nums[i];

               j=j+1;

          }        

       }

       return j;

    }

};