Remove Duplicates from Sorted Array

去除数组重复项

最新推荐文章于 2022-04-06 16:22:53 发布

weixin_30699443

最新推荐文章于 2022-04-06 16:22:53 发布

阅读量42

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/jiadyang/p/8646946.html

本文介绍了一个C++解决方案，用于在不使用额外空间的情况下删除已排序数组中的重复元素，并返回新长度。通过修改输入数组实现这一目标，确保了额外内存使用为O(1)。

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 by modifying the input array in-place with O(1) extra memory.

Example:

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

这道题目跟之前有道题，Remove Element，非常像：

 1 class Solution {
 2 public:
 3     int removeDuplicates(vector<int>& nums) {
 4         int count = 0;
 5         int n = nums.size();
 6         for (int i = 1; i < n; ++i)
 7         {
 8             if (nums[i] == nums[i - 1])
 9             {
10                 ++count;//记重复元素的个数
11             }
12             else
13             {
14                 nums[i - count] = nums[i];
15             }
16         }
17 
18         return n - count;
19     }
20 };