栈
stack := make([]int, 0)
stack = append(stack, 10)
v := stack[len(stack)-1]
stack = stack[:len(stack)-1]
len(stack) == 0
队列
queue := make([]int, 0)
queue = append(queue, 10)
v := queue[0]
queue = queue[1:]
len(queue) == 0
sort
sort.Ints([]int{
})
sort.Strings([]string{
})
sort.Slice(s,func(i,j int)bool{
return s[i]<s[j]})
math
math.MaxInt32
math.MinInt32
math.MaxInt64
math.MinInt64
copy
copy(a[i:],a[i+1:])
a=a[:len(a)-1]
a:=make([]int,n)
a[n]=x
a:=make([]int,0)
a=append(a,x)
类型转换
s := "12345"
num := int(s[0] - '0')
str := string(s[0])
b := byte(num + '0')
fmt.Printf("%d%s%c\n", num, str, b)
num, _ := strconv.Atoi("123")
str := strconv.Itoa(123)