leetcode 448. 找到所有数组中消失的数字

func findDisappearedNumbers(nums []int) []int {
var cd []int
map1 := make(map[int]int)
for i := 1; i <= len(nums); i++ {
map1[nums[i-1]] = i
}
for i := 1; i <= len(nums); i++ {
if _, ok := map1[i]; !ok {
cd = append(cd, i)
}
}
return cd
}

func findDisappearedNumbers(nums []int) []int {

tmp := []int{}

for i := 1; i <= len(nums); i++ {
	for I, V := range nums {
		if i == V {
			break
		}
		if I == len(nums)-1 {
			tmp = append(tmp, i)
		}
	}
}

return tmp

}