Back to Leetcode Go

206. Reverse Linked List

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

1.7.97640 B
Original Source

206. Reverse Linked List

Problem

Reverse a singly linked list.

Summary

Reverse a singly linked list.

Solution Approach

Just follow the problem statement.

Code

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
}