Java for LeetCode 080 Remove Duplicates from Sorted Array II

標籤：

Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?

For example,
Given sorted array 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. It doesn‘t matter what you leave beyond the new length.

解題思路：

本題方法多多，這裡採用另開一個數組的方法，JAVA實現如下：

    public int removeDuplicates(int[] nums) {if (nums.length <= 2)return nums.length;int[] numsCopy = new int[nums.length];numsCopy[0] = nums[0];numsCopy[1] = nums[1];int index = 2;for (int i = 2; i < nums.length; i++) if (nums[i] != numsCopy[index - 2]) {numsCopy[index] = nums[i];index++;}for (int i = 0; i < index; i++)nums[i] = numsCopy[i];return index;    }

 

Java for LeetCode 080 Remove Duplicates from Sorted Array II