LeetCode(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 int removeDuplicates(int[] nums) {
boolean flag = true;
int index = 0;
if(nums.length == 0)
return 0;
for(int i = 1; i < nums.length; i++){
if(nums[index] != nums[i]){
nums[++index] = nums[i];
flag = true;
}
else if(flag == true){
nums[++index] = nums[i];
flag = false;
}
}
return index+1;
}

public class Solution {
public int removeDuplicates(int[] nums) {
if(nums.length <= 2)
return nums.length;
int index = 2;
for(int i = 2; i < nums.length; i++){
if(nums[i] != nums[index-2])
nums[index++] = nums[i];
}
return index;
}

}