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

解释：题干啰嗦一大对意思是返回去重后数组的长度，且原数组在此长度下从0到length-1是有序无重复的。

思路：有序，且限制空间，很容易就联想到双指针。（什么，你没联想到？那再想一会23333）

class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums == null || nums.length == 0 ) return 0;
        int n = 0;
        int o = 1;
        for( ;o < nums.length ; o++){
            if( nums[o] != nums[n]){
                n++;
                if(n != o){
                    nums[n] = nums[o];    
                }                  
            }
        }
        return n+1;
    }
}