26. Remove Duplicates from Sorted Array

Given a sorted array, 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 in place with constant memory.

For example,
Given input arraynums=[1,1,2],

Your function should return length =2, with the first two elements of nums being1and2respectively. It doesn't matter what you leave beyond the new length.

思路：其实是双指针

public class Solution {
    public int removeDuplicates(int[] nums) {
        if (nums.length<2)
            return 1;

        int curr = 0;
        for (int i=1;i<nums.length;i++){
            if (nums[i]!=nums[curr]){
                curr++;
                nums[curr] = nums[i];
            }
        }

        return curr+1;
    }
}