兄弟萌,话不多说,show me the code!
"""有序链表实现:节点Node"""
class Node:
def __init__(self,initdata):
self.data = initdata
self.next = None
def getData(self):
return self.data
def getNext(self):
return self.next
def setData(self,newdata):
self.data = newdata
def setNext(self,newnext):
self.next = newnext
class OrderedList:
def __init__(self):
self.head = None
def isEmpty(self):
return self.head == None
def size(self):
current = self.head
count = 0
while current != None:
current = current.getNext()
count +=1
return count
def remove(self,item):
current = self.head
previous = None
found = False
while (not found and current != None):
if current.getData() == item:
found = True
else:
previous = current
current = current.getNext()
if previous == None:
self.head = current.getNext()
elif previous != None and current != None:
previous.setNext(current.getNext())
else:
print(f"no such item: {item}")
def search(self,item):
current = self.head
found = False
stop = False
while current != None and not found and not stop:
if current.getData() == item:
found = True
else:
if current.getData() > item:
stop = True
else:
current = current.getNext()
return found
def add(self,item):
current = self.head
previous = None
stop = False
while current != None and not stop:
if current.getData() > item:
stop = True
else:
previous = current
current = current.getNext()
temp = Node(item)
if previous == None:
temp.setNext(self.head)
self.head = temp
else:
temp.setNext(current)
previous.setNext(temp)
def print_all(self):
temp = self.head
while temp != None:
print(temp.getData(),end=" ")
temp = temp.getNext()
if __name__ == '__main__':
orl = OrderedList()
orl.add(9)
orl.add(5)
orl.add(3)
orl.add(11)
orl.print_all()
输出:
3 5 9 11