80. Remove Duplicates from Sorted Array II

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

public class Solution {
public int removeDuplicates(int[] nums) {
int count = 0;
if(nums.length<=1)return nums.length;
int slow=0,fast=nums[0]-1;
for(int i = 0 ;i<nums.length;i++){
if(fast!=nums[i]){
fast=nums[i];
count = 1;
}else{
count++;
}
if(count<=2){
nums[slow]=fast;
slow++;
}
}
return slow;
}
}