链表 - 链表翻转

xia_xiao_mo

于 2021-12-30 19:30:43 发布

阅读量566

点赞数

分类专栏：算法专栏文章标签：链表反转迭代 LeetCode 数据结构

本文链接：https://blog.youkuaiyun.com/xia_xiao_mo/article/details/122243933

版权

算法专栏专栏收录该内容

1 篇文章

订阅专栏

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func reverseList(head *ListNode) *ListNode {
    var pre *ListNode
	var cur *ListNode = head
	for cur != nil {
		next := cur.Next
		cur.Next = pre
		pre = cur
		cur = next
	}
	return pre
}

力扣https://leetcode-cn.com/problems/reverse-linked-list/