Leetcode: 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 A = [1,1,2],

Your function should return length = 2, and A is now [1,2].

Solution:

public class Solution {
    public int removeDuplicates(int[] A) {
        int correct = 0;
        for(int i=1; i<A.length; i++)
        {
            if (A[i] != A[correct])
            {
                swap(A,correct+1, i);
                correct++;
            }
        }
        return A.length > 0 ? correct+1: 0;
    }
    
    public void swap(int[] A, int pos1, int pos2)
    {
        int temp = A[pos1];
        A[pos1] = A[pos2];
        A[pos2] = temp;
    }
}