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 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 new length.

 

思路：

　　（1）虽然能AC，但是不对的思路：如果找到重复的数，就将其设置成一个很大的数，最后再排序一下，返回新的长度。

1 class Solution { 2     public int removeDuplicates(int[] nums) { 3         if (nums.length<=1) 4             return nums.length; 5         int duplicate = 0; 6         for (int i=0;i

　　（2）正常的思路：如果有重复的元素，就跳过，然后把后面元素的值赋在重复的位置上

1 class Solution { 2     public int removeDuplicates(int[] nums) { 3         if (nums.length<=1) 4             return nums.length; 5         int index = 0; 6         for (int i=1;i