[LeetCode]26. Remove Duplicates from Sorted Array

最新推荐文章于 2024-12-06 07:02:43 发布

原创最新推荐文章于 2024-12-06 07:02:43 发布 · 287 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #26. Remove Duplicate

LeetCode 专栏收录该内容

30 篇文章

订阅专栏

本文介绍了一种在排序数组中去除重复元素的方法，并提供两种C++实现方案，确保每个元素只出现一次，同时维持常数级内存使用。

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) {
		int count = 0;
		for (int i = 1; i < nums.size(); ++i) {
			if (nums[i] == nums[i - 1]) {
				++count;
			}
			else {
				nums[i - count] = nums[i];
			}
		}
		// 释放多余空间，题目没要求释放,可加可不加
		//nums.erase(nums.end() - count, nums.end());  
		return nums.size();
	}
};

或者如下：

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