【Java】【LeetCode】80. Remove Duplicates from Sorted Array II

题目：

Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

Example 1:

Given nums = [1,1,1,2,2,3],

Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3 respectively.

It doesn't matter what you leave beyond the returned length.

Example 2:

Given nums = [0,0,1,1,1,1,2,3,3],

Your function should return length = 7, with the first seven elements of nums being modified to 0, 0, 1, 1, 2, 3 and 3 respectively.

It doesn't matter what values are set beyond the returned length.

Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

Internally you can think of this:

// nums is passed in by reference. (i.e., without making a copy)
int len = removeDuplicates(nums);

// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
    print(nums[i]);
}

思路：

用变量cur表示当前覆盖到的下一个位置，由于允许一个元素最多可出现两次，则只需要用当前数字 nums[i] 跟 nums[cur-2] 做个比较，只要 num[i] 大，则一定不会有一个元素超过两次（前提是数组必须有序）

代码：

public class RemoveDuplicatesfromSortedArrayII
{

    public static void main(String[] args)
    {
        /**
         * Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new
         * length.
         * 
         * Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra
         * memory.
         */
        /**
         * Clarification:
         * 
         * Confused why the returned value is an integer but your answer is an array?
         * 
         * Note that the input array is passed in by reference, which means modification to the input array will be known to the
         * caller as well.
         * 
         * Internally you can think of this:
         * 
         * // nums is passed in by reference. (i.e., without making a copy)
         * int len = removeDuplicates(nums);
         * 
         * // any modification to nums in your function would be known by the caller.
         * // using the length returned by your function, it prints the first len elements.
         * for (int i = 0; i < len; i++) {
         * print(nums[i]);
         * }
         */
        /**
         * Example 1:
         * Given nums = [1,1,1,2,2,3],
         * Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3 respectively.
         * It doesn't matter what you leave beyond the returned length.
         */
        int[] nums1 = { 1, 1, 1, 2, 2, 3 };
        int length = removeDuplicates(nums1);
        System.out.println(length);
        LeetCodeUtil.printIntArray(nums1, length);
        /**
         * Example 2:
         * Given nums = [0,0,1,1,1,1,2,3,3],
         * Your function should return length = 7, with the first seven elements of nums being modified to 0, 0, 1, 1, 2, 3 and 3
         * respectively.
         * It doesn't matter what values are set beyond the returned length.
         */
        int[] nums2 = { 0, 0, 1, 1, 1, 1, 2, 3, 3 };
        length = removeDuplicates(nums2);
        System.out.println(removeDuplicates(nums2));
        LeetCodeUtil.printIntArray(nums2, length);
    }

    public static int removeDuplicates(int[] nums)
    {
        if (nums == null || nums.length == 0)
        {
            return 0;
        }
        int cur = 0;
        for (int i = 0; i < nums.length; i++)
        {
            if (cur < 2 || nums[i] > nums[cur - 2])
            {
                nums[cur++] = nums[i];
            }
        }
        return cur;
    }

}