leetcode Remove Duplicates from Sorted Array II

public class Solution {
public int removeDuplicates(int[] nums) {
int length=1;
boolean exist=false;
int distance=0;

for(int i=1;i<nums.length;i++)
{
if(nums[i-1-distance]==nums[i])
{

if(exist)
{
distance++;
continue;
}
else
{
exist=true;

}
}
else
{
exist=false;

}
length++;
nums[i-distance]=nums[i];
}
return length;
}
}