- class Solution {
- public:
- intremoveDuplicates(vector<int> &nums) {
- if(nums.empty())
- {
- return 0;
- }
- intn = nums.size(),k=0;
- for(inti=1;ii)
- {
- if(nums[i] != nums[k])
- {
- nums[++k] = nums[i];
- }
- }
- nums.resize(k+1);
- returnk+1;
- }
- };
来源: http://www.bubuko.com/infodetail-1974360.html