LeetCode(一)------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 array A = [1,1,2],
  Your function should return length = 2, and A is now [1,2].

• 题意：
  去除重复元素，每个元素只出现一次，要求不增加新的数组空间实现，且新数组后面的部分不影响，返回值为新数组的长度

• 思路 ：
  给定的数组已经排序，那么用index和i两个下标，index记录新数组的下标，i是原来数组下标，如果nums[i] != nums[index - 1]，那么nums[index] = nums[i]，index 和i 都+1，最后返回index即可。

• 实例代码：

class solution{
    public int removeDuplicates(int[] nums){
        if(nums.length == 0) return 0;
        int index = 1;
        for (int i = 1;i< nums.length;i++){
            if(nums[i] != nums[index-1]){
                nums[index++] = nums[i];
            }
        }
        return index;
    }
}