golang 实现交集、差集、并集

求两个int切片的差集

func SliceDifferenceInt(A, B []int) []int {
	if len(A) < 1 || len(B) < 1 {
		return A
	}
	result := make([]int, 0)
	// 去重
	flagMap := make(map[int]bool, 0)
	for _, a := range A {
		if _, ok := flagMap[a]; ok {
			continue
		}
		flagMap[a] = true
		flag := true
		for _, b := range B {
			if b == a {
				flag = false
				break
			}
		}
		if flag {
			result = append(result, a)
		}
	}
	return result
}

求两个int切片的交集

func SliceIntersectionInt(A, B []int) []int {
	if len(A) < 1 || len(B) < 1 {
		return []int{}
	}
	result := make([]int, 0)
	// 去重
	flagMap := make(map[int]bool, 0)
	for _, a := range A {
		if _, ok := flagMap[a]; ok {
			continue
		}
		flagMap[a] = true
		for _, b := range B {
			if b == a {
				result = append(result, a)
				break
			}
		}
	}
	return result
}

求两个int切片的并集

func SliceUnionInt(A, B []int) []int {
	result := make([]int, 0)
	// 去重
	flagMap := make(map[int]bool, 0)
	A = append(A, B...)
	for _, a := range A {
		if _, ok := flagMap[a]; ok {
			continue
		}
		flagMap[a] = true
		result = append(result, a)
	}
	return result
}