LeetCode刷题（C++）——Remove Duplicates from Sorted Array（Easy）

最新推荐文章于 2021-03-17 22:41:33 发布

原创最新推荐文章于 2021-03-17 22:41:33 发布 · 301 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #C++ #Remove Duplicates #Sorted Array

LeetCode题解专栏收录该内容

69 篇文章

订阅专栏

本文介绍了一个C++程序，用于在不使用额外空间的情况下从已排序数组中移除重复元素，并返回处理后数组的新长度。该算法通过迭代遍历并利用STL容器erase方法实现原地删除重复项。

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.

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if (nums.size() < 2)
			return nums.size();
		for (vector<int>::iterator it = nums.begin()+1;it !=nums.end();)
		{
			if (*it == *(it - 1))
				it = nums.erase(it);
			else
				it++;
		}
		return nums.size();
    }
};