type slice struct {
 array unsafe.Pointer
 len  int
 cap  int
}

func remove(slice []int, i int) []int {
  copy(slice[i:], slice[i+1:])
  return slice[:len(slice)-1]
}

func main() {
  s := []int{5, 6, 7, 8, 9}
  fmt.Println(remove(s, 2)) // "[5 6 8 9]"
}

type funcType func(T) bool //代表筛选逻辑函数，可以按需实现

func filter(a []T, f funcType) []T {
  b := a[:0]
  for _, x := range a {
   if f(x) { 
   b = append(b, x)
   }
  }
  return b
}

func reverse(a []T) []T {
  for i := len(a)/2-1; i >= 0; i-- {
    opp := len(a)-1-i
   a[i], a[opp] = a[opp], a[i]
 }
 
 return a
}

func chunk(actions []int, batchSize int) []int {
 var batches [][]int

 for batchSize < len(actions) {
   actions, batches = actions[batchSize:], append(batches, actions[0:batchSize:batchSize])
 }
 batches = append(batches, actions)
 
  return batches
}

func main() {
 actions := []int{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
 batchSize := 3
  chunks = chunk(actions, batchSize)
  //chunks 为[[0 1 2] [3 4 5] [6 7 8] [9]]
}

input[low:high:max]

import "sort"

func main() {
 in := []int{3,2,1,4,3,2,1,4,1} // any item can be sorted
 sort.Ints(in)
 j := 0
 for i := 1; i < len(in); i++ {
    if in[j] == in[i] {
      continue
 }
 j++

 in[j] = in[i]
 }
 result := in[:j+1]
 fmt.Println(result) // [1 2 3 4] 
}