206. 反转链表

题目：

思路

链表长度>=2,需反转：当前结点的next指向上一个结点
（cur=head 指向头结点 [1,2,3,4,5] 指向1）
代码

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution(object):
    def reverseList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if head == None:
            return None
        if head.next == None:
            return head
        pre = None
        cur = head
        while cur:
            next =cur.next
            cur.next=pre
            pre=cur
            cur=next
        return pre