Remove duplicates from sorted array 2

class Solution {
    public int removeDuplicates(int[] nums) {
        int j=0;
        int n=nums.length;
        if(n<=2) return n;
        for(int i=0; i<n; i++){
            if(i+2<n && nums[i]==nums[i+2]){
               continue;
            }
             nums[j++]=nums[i];
        }
        return j;
    }
}
#Status: Solved with O(n) complexity.