python链表常用操作

最新推荐文章于 2024-07-17 17:25:16 发布

莱维贝贝、

最新推荐文章于 2024-07-17 17:25:16 发布

阅读量403

点赞数 1

分类专栏：数据结构与算法文章标签： python 数据结构链表

本文链接：https://blog.csdn.net/A496608119/article/details/115478117

版权

数据结构与算法专栏收录该内容

13 篇文章 5 订阅

订阅专栏

创建链表

from collections import deque
#Create a Linkedlist
linkedlist = deque()

添加元素

from collections import deque
linkedlist = deque()
#Add element
#Time Complexity： 0（1）
linkedlist.append(1)
linkedlist.append(2)
linkedlist.append(3)
print(linkedlist)
#Insert element
#Time Complexity: O(N)
linkedlist.insert(2, 99)
print(linkedlist)
#deque([1, 2, 99, 3])

访问元素

from collections import deque
linkedlist = deque()
#Add element
#Time Complexity： 0（1）
linkedlist.append(1)
linkedlist.append(2)
linkedlist.append(3)
print(linkedlist)
#Insert element
#Time Complexity: O(N)
linkedlist.insert(2, 99)
print(linkedlist)
#deque([1, 2, 99, 3])

#Access element
# Time complexity: O(N)
element = linkedlist[2]
print(element)
#99

搜索元素

from collections import deque
linkedlist = deque()
#Add element
#Time Complexity： 0（1）
linkedlist.append(1)
linkedlist.append(2)
linkedlist.append(3)
print(linkedlist)
#Insert element
#Time Complexity: O(N)
linkedlist.insert(2, 99)
print(linkedlist)
#deque([1, 2, 99, 3])

#Access element
# Time complexity: O(N)
element = linkedlist[2]
print(element)
#99

# Search element
# Time Complexity: O(N)
index = linkedlist.index(99)
# 2


# Update element
# Time Complexity: O(N)
linkedlist[2] = 88
print(linkedlist)
# deque([1, 2, 88, 3])

删除元素

from collections import deque
linkedlist = deque()
#Add element
#Time Complexity： 0（1）
linkedlist.append(1)
linkedlist.append(2)
linkedlist.append(3)
print(linkedlist)
#Insert element
#Time Complexity: O(N)
linkedlist.insert(2, 99)
print(linkedlist)
#deque([1, 2, 99, 3])

#Access element
# Time complexity: O(N)
element = linkedlist[2]
print(element)
#99

# Search element
# Time Complexity: O(N)
index = linkedlist.index(99)
# 2


# Update element
# Time Complexity: O(N)
linkedlist[2] = 88
print(linkedlist)
# deque([1, 2, 88, 3])

# 删除元素
# Remove element
# Time Complexity：O（N）
# del linkedlist(2)
linkedlist.remove(88)
print(linkedlist)
# deque([1, 2, 3])