206. 反转链表
func reverseList(head *ListNode) *ListNode {if head == nil || head.Next == nil {return head}p := reverseList(head.Next)head.Next.Next = headhead.Next = nilreturn p
}
循环链表的反转
func reverse(head, key *ListNode) *ListNode {if head.Next == key {return head}p := reverse(head.Next, key)head.Next.Next = headhead.Next = preturn p
}
循环链表的打印
func (l *ListNode) String() string {head := lvar res stringfor {res += strconv.Itoa(l.Val)res += "->"l = l.Nextif l == head {break}}fmt.Println("循环链表循环结束")return res
}
)
