LintCode 删除数组中的重复元素题目分析代码

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 slow = 0;
        int fast = 0;
        int count = 0;
        while(fast < nums.length-1)
        {
            if(nums[fast+1] != nums[slow])
            {
                nums[slow] = nums[fast];
                slow++;
                count++;
            }
            fast++;
        }
        return count;
    }
}