反转链表 面试题&leetcode

反转链表

solution

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func reverseList(head *ListNode) *ListNode {
     result :=&ListNode{0,nil}
     cur :=head
     for cur !=nil {
         temp :=&ListNode{cur.Val,result.Next}
         result.Next = temp
         cur = cur.Next
     }
     return result.Next
}