leetcode 反转链表

Given the head of a singly linked list, reverse the list, and return the reversed list.

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