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:
Run time complexity is O(n), constant space.

public class Solution {
    public int removeDuplicates(int[] A) {
        if(A == null || A.length == 0) {
            return 0;
        }
        
        int p1 = 0, p2 = 0;
        while(p2 < A.length) {
            if(A[p1] == A[p2]) {
                p2++;
            }else {
                p1++;
                A[p1] = A[p2];
                p2++;
            }
        }
        
        return p1 + 1;
    }
}