026 Remove Duplicates from Sorted Array

最新推荐文章于 2022-02-11 13:21:04 发布

原创最新推荐文章于 2022-02-11 13:21:04 发布 · 254 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

127 篇文章

订阅专栏

本文介绍了一个高效的算法，用于在不使用额外空间的情况下移除已排序数组中的重复元素，并返回处理后数组的新长度。该方法通过迭代数组并跳过重复项来实现原地修改。

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.

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
using namespace std;

class Solution {
public:
	int removeDuplicates(vector<int>& nums) {
		if(nums.size() == 0) return nums.size();
		int cnt = 1;

		for(int i = 1; i < nums.size(); i++) {
			while(i < nums.size() && nums[i-1] == nums[i])
				i++;
			if(i < nums.size()) {
				cnt++;
				nums[cnt-1] = nums[i];
			}
		}

		return cnt;
	}
};