LeetCode算法题目：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.

分析：

此题目比较简单，扫描数组，比较相邻元素去掉重复即可。

代码实现：

class Solution {public:    int removeDuplicates(vector<int>& nums) {        if(nums.empty())        return 0;        int a = 0;        for (int i = 1;i<nums.size();i++)        {            if (nums[a]!= nums[i])            {                a++;//第一个肯定不重复                nums[a]=nums[i];                            }        }        return a+1;    }};