1、复习头插法
func reverseList(head *ListNode) *ListNode {
var p *ListNode
q:= head
for q!= nil{
r := q.Next
q.Next = p
p = q
q = r
}
return p
}
//递归
func reverseList(head *ListNode) *ListNode {
if head == nil || head.Next == nil {
return head
}
newHead := reverseList(head.Next)
head.Next.Next = head
head.Next = nil
return newHead
}