class Node():
def __init__(self, item):
self.item = item
self.next = None
class Link():
def __init__(self):
self._head = None
def add(self, item):
node = Node(item)
node.next = self._head
self._head = node
# def travel(self):
# print(self._head.item)
# print(self._head.next.item)
# print(self._head.next.next.item)
def travel(self):
cur = self._head
while cur:
print(cur.item)
cur = cur.next
def isEmpty(self):
return self._head == None
def size(self):
cur = self._head
count = 0
while cur:
count += 1
cur = cur.next
return count
link = Link()
link.add(3)
link.add(4)
link.add(5)
link.travel()
print(link.isEmpty())
print(link.size())
python 链表空&长度
最新推荐文章于 2024-05-15 20:26:31 发布