package com.leetcode;

/**
 * LeetCode80_删除有序数组中的重复项II
 */
public class LeetCode80 {

    /**
     * 采用快慢指针
     * @param nums
     * @return
     */
    public int removeDuplicates(int[] nums) {
        int j = nums.length;
        //1.base case
        if (j <= 2) {
            return j;
        }

        //2.初始化快慢指针
        int slow = 1;
        int fast = 2;
        while (fast < j) {
            if (nums[slow - 1] != nums[fast]) {
                slow++;
                nums[slow] = nums[fast];
            }
            fast++;
        }
        return slow + 1;
    }
}