leetcode第13题----- Remove Duplicates from Sorted Array

最新推荐文章于 2019-08-19 22:58:00 发布

原创最新推荐文章于 2019-08-19 22:58:00 发布 · 171 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

本文介绍了一个在不使用额外空间的情况下，对已排序数组进行原地修改以移除重复元素的方法。该方法通过循环遍历数组并向前移动非重复元素来实现，最终返回新的有效数组长度。

题目：

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.

解题思路：

题目要求不能另外申请空间来进行操作，只能在数组里面进行操作。所以，我的想法是每发现一个重复的数字，就把后面所有的数往前进一位，并且数组长度减1.

代码如下：

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

return count;
}
};