题意:
For example, Given sorted array A = [1,1,1,2,2,3],
Your function should return length = 5, and A is now [1,1,2,2,3]
此时返回的是5,也即是元素的个数。
int solution(vector<int> &nums){
int index = 2;
if(nums.size() < 2)
return nums.size();
for ( int i = 2 ; i < nums.size() ; i++ ){
if (nums[i] != nums[index-2])
nums[index++] = nums[i];
}
return index;
}