标签:remove Matter function targe tor pre with == turned
Given a sorted array nums, 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 1:
Given nums = [1,1,2], Your function should return length =2
, with the first two elements ofnums
being1
and2
respectively. It doesn‘t matter what you leave beyond the returned length.
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4], Your function should return length =5
, with the first five elements ofnums
being modified to0
,1
,2
,3
, and4
respectively. It doesn‘t matter what values are set beyond the returned length.
class Solution { public: int removeDuplicates(vector<int>& nums) { int k=0; if(nums.size()==0) return 0; for(int i=0;i<nums.size();i++) { if(nums[i]!=nums[k]) k++; nums[k]=nums[i]; } return k+1; } };
26. Remove Duplicates from Sorted Array
标签:remove Matter function targe tor pre with == turned
原文地址:https://www.cnblogs.com/guoshuai1995/p/10408610.html