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.

定义两个指针i和j，i指向不重复数组的下一位，j指向原数组的下一位，当j发现遍历至重复的数值时，直接跳过，否则令nums[i]=nums[j]，即向不重复数组里面增加元素，这样可以利用原数组的空间，不需要创建新的数组。

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