LintCode 删除排序数组中的重复数字 II题目分析代码

public class Solution {
    /**
     * @param A: a array of integers
     * @return : return an integer
     */
    public int removeDuplicates(int[] nums) {
        // write your code here
    if(nums.length == 0) return 0;
        int fast;
        int slow = 1;
        int count = 0;
        for(fast = 1; fast < nums.length; ++fast)
        {
            if(nums[fast] == nums[slow-1])
            {
                count++;
                if(count>=2)
                    continue;
            }
            else
                count = 0;
            nums[slow] = nums[fast];
            slow++;
        }
        return slow;
    }
}