LeetCode - Remove Duplicates from Sorted Array

Remove Duplicates from Sorted Array

//
public int removeDuplicates(int[] nums) {
        if(nums == null) return 0;
        if(nums.length < 2) return nums.length;
        int k = 0, p = 1;
        while(p < nums.length){
            if(nums[k] != nums[p]){
                nums[++k] = nums[p];
            }
            p++;
        }
        return k+1;
    }
//
public int removeDuplicates(int[] nums) {
        if(nums == null) return 0;
        if(nums.length < 2) return nums.length;
        int k=1;
        for(int i=1; i < nums.length; i++){
            if(nums[k-1] != nums[i]){
                nums[k++] = nums[i];
            }
        }
        return k;
    }