大闸蟹图片,梁冬梅,h para hombres
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.
/* 解题:排好序的数据,删除里面重复的数据 需要注意以下两点: 1.erase()调用之后迭代器失效,需要将iter = nums.erase(iter); 2.考虑nums为空或者只有1个的情况,可以直接返回 */ class solution { public: int removeduplicates(vector& nums) { if(nums.size()<=1) return nums.size(); auto iter = nums.begin() +1; for(;iter!=nums.end();) { if(*iter == *(iter-1)) { iter = nums.erase(iter);//关键!erase()返回的是删除的数据的下一个迭代器 } else ++iter;//没有删除元素的时候+1 } return nums.size(); } };
如对本文有疑问,请在下面进行留言讨论,广大热心网友会与你互动!! 点击进行留言回复
如何在没有core文件的情况下用dmesg+addr2line定位段错误
用QT制作3D点云显示器——QtDataVisualization
网友评论