26. Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place such that each element appear onlyonceand 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 array nums=[1,1,2], Your function should return length =2, with the first two elements of num s 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 nums.length;
        }

        int newInd = 1;
        for (int i=1;i<nums.length;i++){
            if (nums[i]!=nums[i-1]){
                nums[newInd] = nums[i];
                newInd++;
            }
        }
        return newInd;
    }
}