1. Description

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.

2. Runtime Distribution

3. Submission Details

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

5. Code

public class LeetCode0026 {
    public int removeDuplicates(int[] nums) {
        if(nums == null || nums.length == 0) {
            return 0;
        }
        int i = 0;
        for(int j = 1; j < nums.length; j++) {
            if(nums[i] != nums[j]) {
                i++;
            }
            nums[i] = nums[j];
        }
        return i+1;
    }

    public static void main(String[] args) {
        LeetCode0026 leetcode = new LeetCode0026();
        int[] nums = new int[] { 1, 1, 2 };
        System.out.println(leetcode.removeDuplicates(nums));
    }

}