algorithm(leetcode) Remove Duplicates from Sorted Array

removeDuplicates.go

func removeDuplicates(nums []int) int {
    
    if len(nums) == 0 {
        return 0
    }
    
    i := 0
    j := 1
    
    for j < len(nums) {
        if nums[j] != nums[i] {
            i++
            nums[i] = nums[j]
            j++
        } else {
            j++
        }
    }
                
    return i + 1
}