【leetcode】80. Remove Duplicates from Sorted Array II【java】

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.

Remove Duplicates from Sorted Array II (allow duplicates up to 2):

public class Solution {    public int removeDuplicates(int[] nums) {        int i = 0;        for (int n : nums){            if (i < 2 || n > nums[i - 2]){                nums[i] = n;                i++;            }        }        return i;    }}

Remove Duplicates from Sorted Array(no duplicates) :

public int removeDuplicates(int[] nums) {    int i = 0;    for(int n : nums)        if(i < 1 || n > nums[i - 1])             nums[i++] = n;    return i;}