题目来源【Leetcode】
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.
这道题就是删除数组里重复的数字,直接用vector函数来做简单又省事;
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int s = nums.size();
nums.erase( unique(nums.begin(), nums.end() ), nums.end());
return nums.size();
}
};