|
1 | | -package exercise |
| 1 | +package main |
| 2 | + |
| 3 | +import ( |
| 4 | + "fmt" |
| 5 | + "sort" |
| 6 | +) |
| 7 | + |
| 8 | +func main() { |
| 9 | + //栈 |
| 10 | + stack := make([]int, 0) |
| 11 | + stack = append(stack, 10) |
| 12 | + v := stack[len(stack)-1] |
| 13 | + stack = stack[:len(stack)-1] |
| 14 | + if len(stack) == 0 { |
| 15 | + |
| 16 | + } |
| 17 | + |
| 18 | + //队列 |
| 19 | + queue := make([]int, 0) |
| 20 | + queue = append(queue, 10) |
| 21 | + q := queue[0] |
| 22 | + queue = queue[1:] |
| 23 | + fmt.Printf("%d", q) |
| 24 | + if len(queue) == 0 { |
| 25 | + |
| 26 | + } |
| 27 | + |
| 28 | + //map |
| 29 | + m := make(map[string]int) |
| 30 | + m["hello"] = 1 |
| 31 | + delete(m, "hello") |
| 32 | + for k, v := range m { |
| 33 | + print(k, v) |
| 34 | + } |
| 35 | + //map 键需要可比较,不能为 slice、map、function |
| 36 | + //map 值都有默认值,可以直接操作默认值,如:m[age]++ 值由 0 变为 1 |
| 37 | + //比较两个 map 需要遍历,其中的 kv 是否相同,因为有默认值关系,所以需要检查 val 和 ok 两个值 |
| 38 | + fmt.Printf("%d%d", v, stack) |
| 39 | + |
| 40 | + s := []int{1, 2, 3, 4, 5, 6, 9, 4} |
| 41 | + sort.Ints(s) |
| 42 | + println(s) |
| 43 | +} |
0 commit comments