定义一个函数,输入一个链表的头节点,反转该链表并输出反转后链表的头节点。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
限制:
0 <= 节点个数 <= 5000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
func reverseList(head *ListNode) *ListNode {
var root *ListNode
for head != nil {
var tmp = new(ListNode)
tmp.Val = head.Val
tmp.Next = root
root = tmp
head = head.Next
}
return root
}
package main
import "fmt"
type ListNode struct {
Val int
Next *ListNode
}
func main() {
list := []int{1,2,3,4,5}
root := createList(list)
root = reverseList(root)
printList(root)
}
func reverseList(head *ListNode) *ListNode {
var root *ListNode
for head != nil {
var tmp = new(ListNode)
tmp.Val = head.Val
tmp.Next = root
root = tmp
head = head.Next
}
return root
}
func createList(list []int) *ListNode {
root := &ListNode{Val:list[0]}
tail := root
for i:=1;i<len(list);i++ {
tail.Next = &ListNode{Val:list[i]}
tail = tail.Next
}
return root
}
func printList(root *ListNode){
for root != nil {
fmt.Println(root.Val)
root = root.Next
}
}