[LeetCode-Algorithms-26] "Remove Duplicates from Sorted Array" (2017.10.12-WEEK6)

题目链接：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.

(1)思路：向容器中压入一个之前不存在的元素，然后在容器中找与之相同的并增加标记。

(2)代码：

class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int ans = 0, i = 0;
vector<int> ans2;
while (i < nums.size()) {
ans++;
ans2.push_back(nums[i]);
int x = nums[i];
while (i < nums.size() && x == nums[i])
i++;
}
for (int i = 0; i < ans2.size(); i++)
nums[i] = ans2[i];
return ans;
}
};

(3)提交结果：