Remove Duplicates from Sorted Array II | Leet Code | Medium | 80

An Array traversal, addition to Remove Duplicates from Sorted Array |

[sameerpande]

we can also implement like previous problem by adding a count

class Solution {

public int removeDuplicates(int[] nums) {

int j=0;
int count=0;
for(int i=0;i< nums.length - 1; i++){
if(nums[i] != nums[i+1]){
nums[j]=nums[i];
j++;
count=0; // reset count if element is new
} else if( count < 1){
nums[j]=nums[i];
j++;
count++; // check till max count
}
}
nums[j] = nums[nums.length-1];
return j + 1;
}
}