Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

Example 1:

Given nums = [1,1,2],Your function should return length = 2, with the first two elements of nums being 1 and 2
respectively.It doesn't matter what you leave beyond the returned length.

Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4],Your function should return length = 5, with the first five elements of nums
being modified to 0, 1, 2, 3, and 4respectively.It doesn't matter what values are set beyond the returned length.

package main

import "fmt"

type ListNode struct {
	Val int
	Next *ListNode
}


func removeDuplicates(nums []int) int {
	if nums == nil || len(nums) == 0 {
		return 0
	}
	lastNum := nums[0]
	lenNew := 1
	for i := 1; i < len(nums); i++ {
		if lastNum == nums[i] {
			continue
		} else {
			lastNum = nums[i]
			nums[lenNew] = nums[i]
			lenNew++
		}
	}
	return lenNew
}

func main()  {
	arrays := []int{1,1,2}
	fmt.Println(removeDuplicates(arrays))
}