Reverse a singly linked list.
头插法
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
func reverseList(head *ListNode) *ListNode {
if nil == head {
return nil
}
ret := head
head = head.Next
ret.Next = nil
for ; head != nil; {
tmp := head
head = head.Next
tmp.Next = ret
ret = tmp
}
return ret
}
题目 Reverse a singly linked list. 解题思路 头插法 代码
Leetcode 206. Reverse Linked List. 【Easy】【Green】 Leetcode...
206. Reverse Linked List 题目:https://leetcode.com/problems...
206. Reverse Linked List --- Easy[https://leetcode.com/pr...
206. 反转链表[https://leetcode-cn.com/problems/reverse-linked...
206. 反转链表[https://leetcode-cn.com/problems/reverse-linked...
问题链接 206. 反转链表[https://leetcode-cn.com/problems/reverse-l...
题目地址(206. 反转链表) https://leetcode.cn/problems/reverse-link...
定义ListNode节点结构体 例题：链表链接 LeetCode 206. Reverse Linked Lis...
< 思维导图 > 预备知识：链表基础 (★) 链表全部逆序 (★) LeetCode 206. Reverse L...
本文标题：[LeetCode By Go 50]206. Reverse
本文链接：https://www.haomeiwen.com/subject/kvnldxtx.html
网友评论