python//leetcode 206、反转链表

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        a=[]
        if head is None:
            return head
        if head is not None:
            while True:
                a.append(head)
                head=head.next
                if head is None:
                    break
            for i in reversed(range(len(a))):
                if i>0:
                    a[i].next=a[i-1]
                if i==0:
                    a[i].next=None
            return a[len(a)-1]

reversed是翻转队列