Shulou(Shulou.com)05/31 Report--

This article will explain in detail how to find rings on a single linked list in Golang. The editor thinks it is very practical, so I share it for you as a reference. I hope you can get something after reading this article.

Question: an one-way linked list, how to detect whether there is a ring, and what is the initial node of the ring?

Package mainimport ("fmt") type ListNode struct {value int next * ListNode} func NewListNode (I int) * ListNode {val: = new (ListNode) val.value = i return val} func main () {A1: = NewListNode (1) a2: = NewListNode (2) a3: = NewListNode (3) a4: = NewListNode (4) a5: = NewListNode (5) / / 1 → 2 → 3 → 4 → 5 / / ↑⎽⎽⎽⌟ a1.next = a2 a2.next = a3 a3.next = a4 a4.next = a5 a5.next = a3 head: = DetectCycle (A1) fmt.Println (head.value)} func DetectCycle (head * ListNode) * ListNode {fast: = head slow: = head for {if fast.next = = nil | slow.next = = nil {break} fast = Fast.next.next slow = slow.next if fast = = slow {/ / find the meeting point of fast and slow pointers break}} if fast = = nil | | slow = = nil {return nil} / / after finding the meeting point of fast and slow pointers Move at the same speed as the pointer. Find the starting point of the ring slow = head for {if fast = = slow {break} fast = fast.next slow = slow.next} return slow}. This is the end of the article on "how to find a ring on a single linked list by Golang". I hope the above content can be helpful to you, so that you can learn more knowledge. If you think the article is good, please share it for more people to see.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.