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.

Have you met this question in a real interview? Yes
Example
Given input array A = [1,1,2],

Your function should return length = 2, and A is now [1,2].

---

双索引.

public class Solution {
    /**
     * @param A: a array of integers
     * @return : return an integer
     */
    public int removeDuplicates(int[] nums) {
        // write your code here
        if(nums==null)return -1;
        if(nums.length<=1)return nums.length;

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