LeetCode——026

/*
26. Remove Duplicates from Sorted Array My Submissions QuestionEditorial Solution
Total Accepted: 125285 Total Submissions: 375347 Difficulty: Easy
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.

Subscribe to see which companies asked this question
*/

/*
解题思路：
使用双指针的策略
设置两个游标i 和 index ，使i往前遍历数组，只有满足条件的元素才移动index,保证0~index是最终留下的元素。
最后返回去重之后数组的大小，因为函数给出的是数组的引用，还要保证数组最终无重复才可以，所以重新对数组的大小进行界定
*/

class Solution {public:    int removeDuplicates(vector<int>& nums) {        if(nums.size()<2)return nums.size();            int index=0;        for(int i=0;i<nums.size();i++){            if(i==0)nums[index++]=nums[i];            else if(nums[i]!=nums[index-1]) {                nums[index++]=nums[i];            }        }       nums.resize(index);       return index;    }};