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.

Solution1:

第一眼看这道题以为是不是做过了又做重了。翻回去看了下remove element,发现是两道不一样的题。但是想法几乎一模一样。存个index，从后一位检查前一位，如果不同就存新数，如果相同就跳过。最后的index就是长度。稍微tricky的地方就是从二位开始查，但是懂的话很容易就知道。

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

26. Remove Duplicates from Sorted Array