python實現單向鏈表
阿新 • • 發佈:2019-02-10
link rem none 遊標 elif 刪除 bsp bject 鏈表
廢話不說,直接上代碼
#-*-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:
cur=cur.next
count+=1
return count
def travel(self):
"""遍歷整個鏈表"""
cur=self.__head
while cur!=None:
print(cur.elem)
cur=cur.next
def add(self,item):
"""鏈表頭部添加元素"""
node=Node(item)
node.next=self.__head
self.__head=node
def append(self,item):
"""鏈表尾部添加元素"""
if self.is_empty():
self.__head=Node(item)
else:
cur=self.__head
while cur.next!=None:
cur=cur.next
cur.next=Node(item)
def insert(self,pos,item):
"""指定位置添加元素"""
if pos<=0:
self.add(item)
elif pos>self.length()-1:
self.append(item)
else:
pre=self.__head
count=0
while count<pos-1:
pre=pre.next
count+=1
Node(item).next=pre.next
pre.next=Node(item)
def remove(self,item):
"""刪除節點"""
cur=self.__head
pre=None
while cur!=None:
if cur.elem==item:
if cur==self.__head:
self.__head=cur.next
pre.next=cur.next
else:
pre=cur
cur=cur.next
def search(self,item):
"""查找節點是否存在"""
cur=self.__head
while cur!=None:
if cur.elem==item:
return True
else:
cur.next
return False
if __name__=="__main__":
ll=SingleLinkList()
print(ll.is_empty())
print(ll.length())
ll.append(1)
ll.append(2)
ll.append(3)
ll.append(4)
ll.append(5)
ll.append(6)
ll.append(7)
print(ll.is_empty())
print(ll.length())
ll.travel()
python實現單向鏈表