83.Remove Duplicates from Sorted Array

[niuworld]

Question:

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 len = nums.size();
        if (len <= 1)
        return len;
        int j = 1;
        for( int i = 1; i< nums.size(); ++i)
           {    if ( nums[i] == nums[i-1])
                      len--;
                  else    nums[j++] = nums[i];

           }
           return j;

    }
};