#coding:utf-8
class Node(object):
'''节点'''
def __init__(self, elem):
self.elem = elem
self.next = None
class SingleLinkList(object):
'''单链表'''
def __init__(self, node=None):
self._head = node
def is_empty(self):
'''链表是否为空'''
return self._head == None
def length(self):
'''链表长度'''
# cur 游标,用来移动遍历元素
cur = self._head
# count记录数量
count = 0
while cur != None:
count += 1
cur = cur.next
return count
def tarvel(self):
'''便利整个链表'''
cur = self._head
while cur != None:
print(cur.elem, end=" ")
cur = cur.next
print()
def add(self, item):
'''添加元素, 头插法'''
node = Node(item)
node.next = self._head
self._head = node
def append(self, item):
'''链表尾部添加, 尾插法'''
node = Node(item)
if self.is_empty():
self._head = node
else:
cur = self._head
while cur.next != None:
cur = cur.next
cur.next = node
def insert(self, pos, item):
'''指定位置添加元素
:param pos 从0开始
'''
if pos <= 0:
self.add(item)
elif pos > (self.length()-1):
self.append(item)
else:
pre = self._head
count = 0
while count < (pos -1):
count += 1
pre = pre.next
node = Node(item)
node.next = pre.next
pre.next = node
def remove(self, item):
cur = self._head
pre = None
while cur != None:
if cur.elem == item:
#先判断此结点是否是头结点
#头节点
if cur == self._head:
self._head = cur.next
else:
pre.next = cur.next
break
else:
pre = cur
cur = cur.next
def search(self, item):
"""查找节点"""
cur = self._head
while cur != None:
if cur.elem == item:
return True
else:
cur = cur.next
return False
if __name__ == "__main__":
ll = SingleLinkList()
print(ll.is_empty())
print(ll.length())
ll.append(1)
print(ll.is_empty())
print(ll.length())
ll.append(2)
ll.add(8)
ll.append(3)
ll.append(4)
ll.append(5)
ll.append(6)
# 8 1 2 3 4 5 6
ll.insert(-1, 9) # 9 8 1 23456
ll.tarvel()
ll.insert(3, 100)#9 8 1 100 2 3456
ll.tarvel()
ll.insert(10, 200)#9 8 1 100 23456 200
ll.tarvel()
ll.remove(100)
ll.tarvel()
ll.remove(200)
ll.tarvel()
单链表的实现
最新推荐文章于 2022-11-27 22:45:55 发布