python链表反转

例如：1,2,3,4,5  ==> 5,4,3,2,1

# 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: ListNode) -> ListNode:
        pnode = head
        valist = []
        if pnode == None:
            return None
        else:
            while pnode !=None:
                valist.append(pnode.val)
                pnode = pnode.next

            print(valist)

            newChain = ListNode(valist.pop())
            newPnode = newChain
            while len(valist)>0:
                newPnode.next = ListNode(valist.pop())
                newPnode = newPnode.next
                # print(newPnode.val)

            return newChain

if __name__ == '__main__':
    s = Solution()
    head = ListNode(1)
    head.next = ListNode(2)
    head.next.next = ListNode(3)
    new = s.reverseList(head)
    while new != None:
        print(new.val,end=" ")
        new = new.next