[Leetcode] 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.

public class Solution {    public int removeDuplicates(int[] nums) {                int outCount = 0;        int repeatCount = 0;                for (int i = 1; i < nums.length; ++i) {            if (nums[i] != nums[outCount]) {                nums[++outCount] = nums[i];                repeatCount = 1;            } else {                if (repeatCount != 2) {                    nums[++outCount] = nums[i];                    repeatCount = 2;                } else {                    continue;                }            }        }        return outCount + 1;            }}