leetcode_26. 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.

Subscribe to see which companies asked this question.

跟前面做的27挺像的。学到的方法就是：记下相同的，然后减去相同的就应该是当前的位置。

直接贴代码：

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