There are duplicate elements in leetcode. Go implementation

The goal is ： There are duplicate elements

Give you an array of integers nums . If any value appears in the array At least twice , return true ; If each element in the array is different from each other , return false .

---

Result output ：

---

### Brute force

func containsDuplicate(nums []int) bool {
    
	flag := false
	re:
		for i:=0;i<len(nums);i++{
    
			for j:=i+1;j<len(nums);j++{
    
				if nums[i] == nums[j]{
    
					flag =true
					break re
				}
			}
		}
	return flag

}

Usage sort sort.Ints

func containsDuplicate(nums []int) bool {
    
    sort.Ints(nums)
    for i := 1; i < len(nums); i++ {
    
        if nums[i] == nums[i-1] {
    
            return true
        }
    }
    return false
}

Use hash surface

func containsDuplicate(nums []int) bool {
    
    set := map[int]struct{
    }{
    }
    for _, v := range nums {
    
    //set The key value in the table is equal to has Value 
        if _, has := set[v]; has {
    
            return true
        }
        set[v] = struct{
    }{
    }
    }
    return false
}