LeetCode 26. Remove Duplicates from Sorted Array

题目来源：https://leetcode.com/problems/remove-duplicates-from-sorted-array/

问题描述

26. Remove Duplicates from Sorted Array

Easy

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]);
}

------------------------------------------------------------

题意

给定数组S, 在S上原地删除所有S中的重复元素，返回删除后数组的有效长度，保证S的内存空间首地址开始到有效长度内存放的是删除重复元素后的数组。

------------------------------------------------------------

思路

维护两个指针i和j，j用于判断元素是否是重复, i用于存储新元素应该存放的位置。

------------------------------------------------------------

代码

class Solution {
    public int removeDuplicates(int[] nums) {
        int n = nums.length;
        if (n == 0)
        {
            return 0;
        }
        int i = 0, j = 0, cur = nums[i], next = cur;
        boolean repetition_tail = false;
        while (j < n - 1)
        {
            cur = nums[j];
            next = nums[++j];
            while (next == cur)
            {
                if (j == n-1)
                {
                    repetition_tail = true;
                    break;
                }
                next = nums[++j];
            }
            nums[i++] = cur;
        }
        if (!repetition_tail)
        {
            cur = nums[j];
            nums[i++] = cur;
        }
        return i;
    }
}