题目:
Reverse a singly linked list.
题意:
将单链表反转
代码:
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def reverseList(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
if head == None or head.next == None :
return head
else :
p = ListNode(0)
q = ListNode(0)
p = head.next
q = head.next
head.next = None
while p != None :
q = p.next
p.next = head
head = p
p = q
return head
笔记:
定义一个单链表节点:p = ListNode(0)