大家好,又见面了,我是全栈君。
26 Remove Duplicates from Sorted Array
链接:https://leetcode.com/problems/remove-duplicates-from-sorted-array/
问题描写叙述:
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.
Hide Tags Array Two Pointers
去除排序好的数组中i的反复元素。
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size()<2)return nums.size();
int result=0;
for(int i=1;i<nums.size();i++)
{
if(nums[i]!=nums[result])
nums[++result]=nums[i];
}
return result+1;
}
};
在vector中还有更简单的做法,能够利用unique函数。
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
nums.erase( unique(nums.begin(), nums.end() ), nums.end() );
return nums.size();
}
};
发布者:全栈程序员-用户IM,转载请注明出处:https://javaforall.cn/115934.html原文链接:https://javaforall.cn
【正版授权,激活自己账号】: Jetbrains全家桶Ide使用,1年售后保障,每天仅需1毛
【官方授权 正版激活】: 官方授权 正版激活 支持Jetbrains家族下所有IDE 使用个人JB账号...