linked_list_cycle.rs (518B)
1 //! Given head, the head of a linked list, determine if the linked list has 2 //! a cycle in it. 3 //! 4 //! There is a cycle in a linked list if there is some node in the list that 5 //! can be reached again by continuously following the next pointer. 6 //! Internally, pos is used to denote the index of the node that tail's next 7 //! pointer is connected to. Note that pos is not passed as a parameter. 8 //! 9 //! Return true if there is a cycle in the linked list. Otherwise, return false. 10 11 fn solution_1() -> bool { 12 true 13 }