26. Remove Duplicates from Sorted Array My Submissions Question

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.

package leetcode;

public class RemoveDuplicates {
    public static int removeDuplicatesBetter(int A[]) {
        int n = A.length;
        if (n < 2)
            return n;
        int id = 1;
        for (int i = 1; i < n; ++i)
            if (A[i] != A[i - 1])
                A[id++] = A[i];
        return id;
    }

    public static int removeDuplicates(int[] num) {
        int len = num.length;
        int i = 0;
        int j = 1;
        int index = 1;
        while (index < len && j < len) {
            while (num[i] == num[j] && index < len) {
                index++;
                if (index == len) {
                    return j;
                }
                num[j] = num[index];
            }
            index++;
            if (index == len) {
                return j + 1;
            }
            i++;
            j++;
            num[j] = num[index];
        }
        return j + 1;

    }

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

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

}