【LeetCode】26. Remove Duplicates from Sorted Array - Java实现

1. 题目描述：

Given a sorted array nums, remove the duplicates in-place such that each element appear only once 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,2],
Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.
It doesn’t matter what you leave beyond the returned length.

Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4],
Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 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]);
}

2. 思路分析：

题目的意思是给定一个有序数组，其中含有重复数字，最后返回非重复数字个数(length)，并且要求不要使用额外的存储空间，且最后数组的前length个数是去掉重复的。

我们可以使用快慢指针来记录遍历的坐标，最开始时两个指针都指向第一个数字，如果两个指针指的数字相同，则快指针向前走一步，如果不同，则两个指针都向前走一步，这样当快指针走完整个数组后，慢指针当前的坐标加1就是数组中不同数字的个数。注意还得交换数组中的值，见下列代码。

3. Java代码：

源代码：见我GiHub主页

代码：

public static int removeDuplicates(int[] nums) {
    if (nums.length == 0) {
        return 0;
    }
    int preIndex = 0;
    for (int i = 1; i < nums.length; i++) {
        if (nums[i] != nums[preIndex]) {
            // 移动元素值
            nums[++preIndex] = nums[i];
        }
    }
    return preIndex + 1;
}