方式1(使用无缓冲的channel)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34
| package main
import ( "fmt" "time" )
var flagChan = make(chan int)
func wokr1() { for i := 1; i <= 100; i++ { flagChan <- 666 if i%2 == 1 { fmt.Println("协程1打印:", i) } } }
func wokr2() { for i := 1; i <= 100; i++ { _ = <-flagChan if i%2 == 0 { fmt.Println("协程2打印:", i) } } }
func main() { go wokr1() go wokr2()
time.Sleep(3 * time.Second) }
|
两个协程,一个channel,把这个无缓冲的channel当成一把锁使用(起阻塞作用)
或者使用闭包方式,如下(与上面方式一样)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
| package main
import ( "fmt" "time" )
func main() { c := make(chan int) go func() { for i := 1; i < 101; i++ { c <- 666 if i%2 == 1 { fmt.Println("协程1打印:", i) } } }() go func() { for i := 1; i < 101; i++ { <-c if i%2 == 0 { fmt.Println("协程2打印:", i) } } }() time.Sleep(3 * time.Second) }
|
方式2(设置GOMAXPROCS=1)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33
| package main
import ( "fmt" "runtime" "time" )
func main() { runtime.GOMAXPROCS(1) go func() { for i := 1; i < 101; i++ { if i%2 == 1 { fmt.Println("协程1打印:", i) } runtime.Gosched() } }() go func() { for i := 1; i < 101; i++ { if i%2 == 0 { fmt.Println("协程2打印:", i) } runtime.Gosched() } }() time.Sleep(3 * time.Second) }
|
借此可以搞清楚*runtime.GOMAXPROCS(1)和runtime.Gosched()*的使用方式
交替打印切片中奇偶数位元素的值
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
| package main
import ( "fmt" "time" )
func main() {
sli := make([]int, 100) for k := 0; k < 100; k++ { sli[k] = k * 10 }
c := make(chan int) go func() { for i := 0; i < len(sli); i++ { c <- 666 if i%2 == 1 { fmt.Println("协程1打印:", sli[i]) } } }() go func() { for i := 0; i < len(sli); i++ { <-c if i%2 == 0 { fmt.Println("协程2打印:", sli[i]) } } }() time.Sleep(3 * time.Second)
}
|
交替打印单链表中奇偶数位元素的值
面试HashData时遇到
类似 leetcode-328 奇偶链表
原文链接: https://dashen.tech/2022/04/03/Go用两个协程交替打印100以内的奇偶数/
版权声明: 转载请注明出处.