LeetCode T26 Remove Duplicates from Sorted Array

题目地址：

中文：https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/
英文：https://leetcode.com/problems/remove-duplicates-from-sorted-array/

题目描述：

Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns 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 a 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:

Input: nums = [1,1,2]
Output: 2, nums = [1,2]
Explanation: 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:

Input: nums = [0,0,1,1,1,2,2,3,3,4]
Output: 5, nums = [0,1,2,3,4]
Explanation: 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.

Constraints:

0 <= nums.length <= 3 * 10^4
-10^4 <= nums[i] <= 10^4
nums is sorted in ascending order.

思路：

本题是要去除数组里的重复元素，然后把不重复的k个数都挪到数组的前k个位置去，而且规定空间复杂度为O(1)，就是说不能开一个数组存，只能在当前数组动，这里只需要一个变量res保存出现过的重复数字次数就可以了，这样遍历数组，将每个数组前移res个，最后数组就满足题目要求了。

题解：

class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums.length==0) return 0;
        int res=0;
        for(int i=1;i<nums.length;i++){
            if(nums[i]==nums[i-1])
                res++;
            nums[i-res]=nums[i];
        }
        return nums.length-res;
    }
}