Leetcode1-100: 26. Remove Duplicates from Sorted Array

问题描述

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

题目要求： 输入一个有序数组，去掉数组中重复的元素。注意这题的要求是只返回一个整数，代表数组中前多少个数字是给出的输出，意思就是如果输入[1,1,2,2,3] ,只需要输出结果3，然后数组的前三个元素分别是1，2，3即可（顺序不限）。

解题思路

顺序迭代数组中的元素，然后用一个数字代表当前发现的不重复数字的个数，如果遇到不同的数字，就直接赋值当前的元素然后将个数增加1即可

代码实现

    public int removeDuplicates(int[] nums) {
        if(nums.length <= 1) return nums.length;
        int res = 0;
        //从第二个元素开始，然后每次比较是否跟前一个元素相同，如果不同就发现新元素
        for(int i = 1; i < nums.length; i++) {
            if(nums[i] != nums[i-1]) //发现了新元素
                nums[++res] = nums[i]; //赋值新元素，并增加个数
        }
        return res+1;
    }

复杂度分析：

时间复杂度：O(n)
空间复杂度：O(1)