/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
func reverseList(head *ListNode) *ListNode {
var pre *ListNode = nil
for {
if head == nil {
break
}
tmp := head.Next
head.Next = pre
pre = head
head = tmp
}
return pre
}
golang leetcode reverse Linked List
猜你喜欢
转载自blog.csdn.net/onwingsofsong/article/details/82313837
今日推荐
周排行