leetcode Reverse Linked List---简单重点

https://leetcode.com/problems/reverse-linked-list/

设立 cur, last, next 三个pointers, 熟悉这段code

这里要熟悉这段code，这里last指的是已经reverse部分的head节点

last, cur = None, head
while cur:
	next = cur.next
	cur.next = last
	last = cur
	cur = next

my code：自己的code写得没有很流畅，需要改成上面的code

class Solution(object):
    def reverseList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if not head:
            return []
        
        i = head.next
        j = head
        j.next = None
        if not i:
            return head
        
        while i:
            k = i.next
            i.next = j
            j = i
            i = k
        return j