Remove Duplicates from Sorted Array

题目：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 & nums) { if(nums.size() == 0) return 0; int index = 0; for(int i = 1; i