python链表详细讲解_剑指offer详解（链表）——python

# -*- coding:utf-8 -*-

# class ListNode:

# def __init__(self, x):

# self.val = x

# self.next = None

class Solution:

# 返回从尾部到头部的列表值序列，例如[1,2,3]

def printListFromTailToHead(self, listNode):

# write code here

if not listNode:

return []

l=[]

while listNode:

l.append(listNode.val)

listNode=listNode.next

return l[::-1]class Solution:

def FindKthToTail(self, head, k):

# write code here

if not head or k<=0: return None

p=q=head

t=0

while p and t < k: # 将两个指针隔开k的距离

p=p.next

t+=1

if t

while p!=None: # 否则将从头的链表移动到已经移动的链表移动到结尾为止

q=q.next

p=p.next

return q

同时也是206. 反转链表(leetcode)

反转一个单链表。

示例:

输入: 1->2->3->4->5->NULL

输出: 5->4->3->2->1->NULL

迭代解法：class Solution:

def reverseList(self, head: ListNode) -> ListNode:

cur, pre = head, None

while cur:

temp=cur.next # 保存原链表后续的内容，不让链表断掉。temp就是原链表从第二个节点开始的一个链表

cur.next=pre #把cur的指针直接指向pre

pre=cur # 替换这个改造后的pre

cur=temp # 替换这个改造后的cur

return pre# class ListNode:

# def __init__(self, x):

# self.val = x

# self.next = None

class Solution:

# 返回合并后列表

def Merge(self, pHead1, pHead2):

# write code here

if pHead1 == None:

return pHead2

if pHead2 == None:

return pHead1

cur = ListNode(0)

# while pHead1 and pHead2:

if pHead1.val<= pHead2.val:

cur=pHead1

cur.next=self.Merge(pHead1.next, pHead2)

else :

cur=pHead2

cur.next=self.Merge(pHead1, pHead2.next)

return cur

用递归去做，会很简单，但这题可能不适合pythonclass Solution:

# 返回 RandomListNode

def Clone(self, pHead):

# write code here

if not pHead: return None

pCopy=RandomListNode(pHead.label) # 新建一个和pHead一样内容的RandomListNode对象

pCopy.random=pHead.random # 一个RandomListNode需要指定的值就是random和next

# pCopy.next=pHead.next

pCopy.next=self.Clone(pHead.next)

return pCopy