题解 | #反转链表#
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
package main import . "nc_tools" /* * type ListNode struct{ * Val int * Next *ListNode * } */ /** * * @param pHead ListNode类 * @return ListNode类 */ func ReverseList(pHead *ListNode) *ListNode { // write code here if pHead == nil { return nil } now := pHead next := pHead.Next now.Next = nil for next != nil { now, next, next.Next = next, next.Next, now } return now }超级简单,利用go的特性不用中间变量