/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/funcreverseList(head *ListNode)*ListNode {var pre *ListNode =nilfor head !=nil{
head , pre, head.Next = head.Next, head, pre
}return pre
}
Go 算法 leetcode 206 反转链表题目链接答案题目给你单链表的头节点 head ,请你反转链表,并返回反转后的链表。链接leetcode 206 反转链表答案/** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */func reverseList(head *ListNode) *ListNode { va