本文實例講述了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
希望本文所述對大家Python程序設計有所幫助。
新聞熱點
疑難解答
