LeetCode 26.Remove Duplicates from Sorted Array

Link：https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/
Description：

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

Topic：双指针
Thinking：
如果只是统计不重复的数的个数，只需要遍历一遍数组，用一个变量记录个数就行了。
本题要求从数组的原位置删除重复的数，那就需要让数组后面的数往前移动。后面的数前移是有选择的，只有和前面的数不相同的数才需要前移。
所以用两个指针，一个用来挨个遍历数组的每一个元素，另一个用来指向最后一个不重复的数。
Code：

class Solution {
    public int removeDuplicates(int[] nums) {
         if (nums.length < 2) {
            return nums.length;
        }
        int i=0;
        for(int j=1; j<nums.length; j++) {
            if (nums[i] != nums[j]) {
                if(j > i + 1) {#相邻的两个数不相同，无需移动
                    nums[i + 1] = nums[j];
                }
                ++i;
            }
        }
        return i+1;
    }
}