algorithm

package

v0.0.0-...-82289f8 Latest Latest Go to latest Published: Jul 30, 2020 License: MIT Imports: 0 Imported by: 0

Details

反转一个单链表。

示例:

输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL

进阶: 你可以迭代或递归地反转链表。你能否用两种方法解决这道题？

This section is empty.

This section is empty.

This section is empty.

type ListNode struct {
	Val  int
	Next *ListNode
}