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 UnorderedList:
def __init__(self):
self.head = None
self.size = 0
def isEmpty(self):
return self.head == None
# add项非常重要,它决定了无序链表的数据构建方式!!!!
def add(self, item):
temp = Node(item)
# 为item生成节点信息:数据项本身+下一个节点的引用信息
temp.setNext(self.head)
# 设置当前节点temp指向下一个节点(原来为self.head),
# 第一个加进去的节点指向None,
self.head = temp
# 表头指向当前新增的节点temp,head这个数据包含了temp的数据信息、
# 对下一个节点的引用信息
self.size += 1
def size(self):
current = self.head
# current指向的是下一个节点,所以它指向了下一个节点的数据项、
# 对下一个节点的引用信息,可以用getData、getNext调用
count = 0
while current != None:
count += 1
current = current.getNext()
return count
def search(self, item):
current = self.head
found = False
while current != None and not found:
if current.getData() == item:
found = True
else:
current.getNext()
return found
def remove(self, item):
current = self.head
previous = None
found = False
while not found:
if current.getData() == item:
found = True
else:
previous = current
current = current.getNext()
if previous == None:
self.head = current.getNext()
else:
previous.setNext(current.getNext())
self.size -= 1
if __name__ == "__main__":
my_list = UnorderedList()
my_list.add(20)
my_list.add(21)
print(my_list.head)
print(my_list.head.getData())
'''
my_list.add(57)
print(my_list.size)
my_list.remove(20)
print(my_list.size)
'''
Python:无序列表的实现,以及一些思考
猜你喜欢
转载自blog.csdn.net/qq_40797015/article/details/114673790
今日推荐
周排行