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 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.输入的是已排序的数组；

2.不可再申请额外空间；

3.数组中元素的位置不能改变。比如对于数组[1,1,1,4,5]，移除重复元素后为[1,4,5]，起始数字为1，而不能是其它数字。

package leetcode;

public class RemoveDuplicatesFromSortedArray {

public static int removeDuplicates(int[] nums) {

        int ans = nums.length;

        if (ans == 0 || ans == 1) return ans;

        int index = 1;

        for (int i = 1; i<nums.length; i++){

        if (nums[i] == nums[i-1]){

        continue;

        }else{

        nums[index] = nums[i];

        index++;

        }

        }

        return index;

    }

public static void main(String[] args) {

// TODO Auto-generated method stub

int[] nums = {1,1,2};

System.out.println(removeDuplicates(nums));

}

}