Python3实现的反转单链表算法示例

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

# -*- coding:utf-8 -*-# class ListNode:#   def __init__(self, x):#     self.val = x#     self.next = Noneclass Solution:  # 返回ListNode  def ReverseList(self, pHead):    # write code here    if not pHead or not pHead.next:      return pHead    else:      newHead = self.ReverseList(pHead.next)      pHead.next.next=pHead      pHead.next=None      return newHead