Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?
For example,
Given sorted array nums = [1,1,1,2,2,3]
,
Your function should return length = 5
, with the first five elements of nums being 1
, 1
, 2
, 2
and 3
. It doesn't matter what you leave beyond the new length.
Subscribe to see which companies asked this question
package leetcode80;
public class Solution {
public int removeDuplicates(int[] nums) {
return remove(nums, 2);
}
public int remove(int[] nums, int k){
int n = nums.length;
if(n<k) return n;
int cnt=1;
int j=1;
for(int i=1;i<n;i++){
if(nums[i]==nums[i-1]){
cnt++;
if(cnt>k)
continue;
else{
nums[j++]=nums[i];
}
}else{
cnt=1;
nums[j++]=nums[i];
}
}
return j;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] nums = {1,1,1,2,2,3};
System.out.println(new Solution().removeDuplicates(nums));
}
}