代码片段 #

func contains(s []int, e int) bool {
    for _, a := range s {
        if a == e {
            return true
        }
    }
    return false
}

// 最前面插入一个元素
x = append([]int{1}, x...)

// An allocation is only necessary when there is no spare slice capacity.
x = append(x, 0)
copy(x[1:], x)
x[0] = 1

func SliceIndex(limit int, predicate func(i int) bool) int {
    for i := 0; i < limit; i++ {
        if predicate(i) {
            return i
        }
    }
    return -1
}

// 保持有序
func remove(slice []int, s int) []int {
    return append(slice[:s], slice[s+1:]...)
}

// 无序
func remove(s []int, i int) []int {
    s[i] = s[len(s)-1]
    // We do not need to put s[i] at the end, as it will be discarded anyway
    return s[:len(s)-1]
}

func remove(s []string, e string) []string {
    result := s[:0]
    for _, item := range s {
        if item != e {
            result = append(result, item)
        }
    }

    return result
}