class Node:
def __init__(self, init_data):
self.data = init_data
self.next = None
def get_data(self):
return self.data
def get_next(self):
return self.next
def set_data(self, new_data):
self.data = new_data
def set_next(self, new_next):
self.next = new_next
class OrderedList:
def __init__(self):
self.head = None
def is_empty(self):
return self.head is None
def add(self, item):
current = self.head
previous = None
while current is not None:
if current.get_data() > item:
break
else:
previous = current
current = current.get_next()
node = Node(item)
if previous is None:
'''表头插入'''
node.set_next(self.head)
self.head = node
else:
'''表中插入'''
node.set_next(current)
previous.set_next(node)
def size(self):
current = self.head
count = 0
while current is not None:
count = count + 1
current = current.get_next()
return count
def search(self, item):
current = self.head
while current is not None:
if current.get_data() == item:
return True
else:
if current.get_data() > item:
return False
else:
current = current.get_next()
return False
def remove(self, item):
current = self.head
previous = None
found = False
while not found:
if current.get_data() == item:
found = True
else:
previous = current
current = current.get_next()
if previous is None:
self.head = current.get_next()
else:
previous.set_next(current.get_next())
if __name__ == '__main__':
ol = OrderedList()
ol.add(1)
ol.add(7)
ol.add(9)
ol.add(6)
print(ol.search(9))
