#!/usr/bin/python3
#在链表的末端插入新的节点。
class Node():
def __init__(self,data=None):
self.data=data
self.next=None
class LinkedList():
def __init__(self):
self.head=None
def printList(self):
ptr=self.head
while ptr:
print(ptr.data)
ptr=ptr.next
def ending(self,newdata):
newNode=Node(newdata)
if self.head==None:
self.head=newNode
return
lastPtr=self.head
while lastPtr.next:
lastPtr=lastPtr.next
lastPtr.next=newNode
link=LinkedList()
link.head=Node(5)
n2=Node(15)
n3=Node(25)
link.head.next=n2
n2.next=n3
link.printList()
print("新的链表")
link.ending(100)
link.printList()
Python语言例题集(010)
于 2024-04-03 19:29:41 首次发布