LeetCode----- 26. 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 by modifying the input array in-place with O(1) extra memory.

Example:

Given 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.

给定一个有序数组，删除重复内容，使每个元素只出现一次，并返回新的长度。不要为其他数组分配额外的空间，您必须通过在O（1）额外的内存中就地修改输入数组来实现这一点。

代码如下:

public class RemoveDuplicatesfromSortedArray {

	public static void main(String[] args) {
		int[] nums = new int[]{1,1,2};
		System.out.println(removeDuplicates(nums));
	}
	
    public static int removeDuplicates(int[] nums) {
    	if(nums.length <0) {
    		return 0;
    	}
    	int result=0 ;
    	
    	for (int i = 1; i < nums.length; i++) {
			if(nums[i] != nums[result]) {
				result++;
				nums[result] = nums[i];
			}
		}
    	
        return result+1;
    }

}