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
//思路首先：他已经说了有序了，所以就简单了
class Solution {
public:
int removeDuplicates(vector<int> &nums) {
if(nums.size() < 2)
return nums.size();
int len = 1;
for(int i = 1; i < nums.size(); i++){
if(nums[i] != nums[i - 1])
nums[len++] = nums[i];
}
return len;
}
};注：本博文为EbowTang原创，后续可能继续更新本文。如果转载，请务必复制本条信息！
原文地址：http://blog.csdn.net/ebowtang/article/details/50499722
原作者博客：http://blog.csdn.net/ebowtang
<LeetCode OJ> 26. Remove Duplicates from Sorted Array
原文：http://blog.csdn.net/ebowtang/article/details/50499722