Python单链表逆置

1、循环反转单链表

# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    def ReverseList(self, pHead):
        if not pHead or not pHead.next:
            return pHead
          
        last = None
          
        while pHead:
            tmp = pHead.next
            pHead.next = last
            last = pHead
            pHead = tmp
        return last

2、递归反转单链表

# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
def ReverseList(self, pHead):
      if head is None:  
       	  return;  
      if head.next is None:  
          newhead=head;  
      else :  
	  newhead=recurse(head.next,newhead);  

          head.next.next=head;  

          head.next=None;  
      return newhead;