Function singleNumber2

single_number_136/solution.go:24–44

(nums []int)

}

func singleNumber2(nums []int) int {
	seen := make(map[int]bool)
	for i := 0; i < len(nums); i++ {
		_, ok := seen[nums[i]]
		if !ok {
			seen[nums[i]] = false
		} else {
			seen[nums[i]] = true
		}
	}

	single := -1
	for k, v := range seen {
		if !v {
			single = k
			break
		}
	}

	return single
}