Last active
May 27, 2019 09:47
-
-
Save takatoshiono/6835c961892497ac9fd28f7710cf22b1 to your computer and use it in GitHub Desktop.
A Tour of Go: Exercise Equivalent Binary Trees, https://go-tour-jp.appspot.com/concurrency/8
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package main | |
import "golang.org/x/tour/tree" | |
import "fmt" | |
// Walk walks the tree t sending all values | |
// from the tree to the channel ch. | |
func Walk(t *tree.Tree, ch chan int) { | |
var walker func(t *tree.Tree) | |
walker = func(t *tree.Tree) { | |
if t == nil { | |
return | |
} | |
walker(t.Left) | |
ch <- t.Value | |
walker(t.Right) | |
} | |
walker(t) | |
close(ch) | |
} | |
// Same determines whether the trees | |
// t1 and t2 contain the same values. | |
func Same(t1, t2 *tree.Tree) bool { | |
ch1, ch2 := make(chan int), make(chan int) | |
go Walk(t1, ch1) | |
go Walk(t2, ch2) | |
for value := range ch1 { | |
if value != <-ch2 { | |
return false | |
} | |
} | |
return true | |
} | |
func main() { | |
ch := make(chan int) | |
go Walk(tree.New(1), ch) | |
for i := 0; i < 10; i++ { | |
fmt.Println(<-ch) | |
} | |
fmt.Println(Same(tree.New(1), tree.New(1))) | |
fmt.Println(Same(tree.New(1), tree.New(2))) | |
} |
やった
👍
赞
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
いくつか回答をググって学んだこと