Back to Leetcode Go

206. Reverse Linked List

website/content/ChapterFour/0200~0299/0206.Reverse-Linked-List.md

1.7.1990 B
Original Source

206. Reverse Linked List

题目

Reverse a singly linked list.

题目大意

翻转单链表

解题思路

按照题意做即可。

代码

go

package leetcode

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */

// ListNode define
type ListNode struct {
	Val  int
	Next *ListNode
}

func reverseList(head *ListNode) *ListNode {
	var behind *ListNode
	for head != nil {
		next := head.Next
		head.Next = behind
		behind = head
		head = next
	}
	return behind
}


<div style="display: flex;justify-content: space-between;align-items: center;"> <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0205.Isomorphic-Strings/">⬅️上一页</a></p> <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0200~0299/0207.Course-Schedule/">下一页➡️</a></p> </div>