很感谢这位老哥,一下子打通了很多go的知识点!
func findWhetherExistsPath(n int, graph [][]int, start int, target int) bool {
edges := make([][]int,n)
Flag := make([]int,n)
for i:=0;i<len(graph);i++{
edges[graph[i][0]] = append(edges[graph[i][0]],graph[i][1])
}
queue := make([]int,0)
queue = append(queue,start)
for len(queue) > 0{
tmp := queue[0]
queue = queue[1:]
Flag[tmp] = 1
if tmp == target{
return true
}
for i:=0;i<len(edges[tmp]);i++{
if Flag[edges[tmp][i]] == 0{
queue = append(queue,edges[tmp][i])
}
}
}
return false
}
作者:hwhzzly
链接:https://leetcode-cn.com/problems/route-between-nodes-lcci/solution/go-bfs-9063-by-hwhzzly/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。