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;
    }

}