Remove Duplicates from Sorted Array

Given input array nums = [1,1,2], Your function should return length = 2

• Time: O(n)
• Space: O(1)

public int removeDuplicates(int[] nums) {
    int count = 1;
    for (int i = count; i < nums.length; i++) {
        if (nums[i] != nums[count - 1]) {
            nums[count++] = nums[i];
        }
    }
    return count;
}