python列表操作实例
程序员文章站
2022-03-25 10:04:58
...
本文实例讲述了python列表操作的方法。分享给大家供大家参考。
具体实现方法如下：
复制代码 代码如下:
class Node:
"""Single node in a data structure"""
def __init__(self, data):
"""Node constructor"""
self._data = data
self._nextNode = None
def __str__(self):
"""Node data representation"""
return str(self._data)
class List:
"""Linked list"""
def __init__(self):
"""List constructor"""
self._firstNode = None
self._lastNode = None
def __str__(self):
"""List string representation"""
if self.isEmpty():
return "empty"
currentNode = self._firstNode
output = []
while currentNode is not None:
output.append(str(currentNode._data))
currentNode = currentNode._nextNode
return " ".join(output)
def insertAtFront(self, value):
"""Insert node at front of list"""
newNode = Node(value)
if self.isEmpty(): # List is empty
self._firstNode = self._lastNode = newNode
else: # List is not empty
newNode._nextNode = self._firstNode
self._firstNode = newNode
def insertAtBack(self, value):
"""Insert node at back of list"""
newNode = Node(value)
if self.isEmpty(): # List is empty
self._firstNode = self._lastNode = newNode
else: # List is not empty
self._lastNode._nextNode = newNode
self._lastNode = newNode
def removeFromFront(self):
"""Delete node from front of list"""
if self.isEmpty(): # raise exception on empty list
raise IndexError, "remove from empty list"
tempNode = self._firstNode
if self._firstNode is self._lastNode: # one node in list
self._firstNode = self._lastNode = None
else:
self._firstNode = self._firstNode._nextNode
return tempNode
def removeFromBack(self):
"""Delete node from back of list"""
if self.isEmpty(): # raise exception on empty list
raise IndexError, "remove from empty list"
tempNode = self._lastNode
if self._firstNode is self._lastNode: # one node in list
self._firstNode = self._lastNode = None
else:
currentNode = self._firstNode
# locate second-to-last node
while currentNode._nextNode is not self._lastNode:
currentNode = currentNode._nextNode
currentNode._nextNode = None
self._lastNode = currentNode
return tempNode
def isEmpty(self):
"""Returns true if List is empty"""
return self._firstNode is None
"""Single node in a data structure"""
def __init__(self, data):
"""Node constructor"""
self._data = data
self._nextNode = None
def __str__(self):
"""Node data representation"""
return str(self._data)
class List:
"""Linked list"""
def __init__(self):
"""List constructor"""
self._firstNode = None
self._lastNode = None
def __str__(self):
"""List string representation"""
if self.isEmpty():
return "empty"
currentNode = self._firstNode
output = []
while currentNode is not None:
output.append(str(currentNode._data))
currentNode = currentNode._nextNode
return " ".join(output)
def insertAtFront(self, value):
"""Insert node at front of list"""
newNode = Node(value)
if self.isEmpty(): # List is empty
self._firstNode = self._lastNode = newNode
else: # List is not empty
newNode._nextNode = self._firstNode
self._firstNode = newNode
def insertAtBack(self, value):
"""Insert node at back of list"""
newNode = Node(value)
if self.isEmpty(): # List is empty
self._firstNode = self._lastNode = newNode
else: # List is not empty
self._lastNode._nextNode = newNode
self._lastNode = newNode
def removeFromFront(self):
"""Delete node from front of list"""
if self.isEmpty(): # raise exception on empty list
raise IndexError, "remove from empty list"
tempNode = self._firstNode
if self._firstNode is self._lastNode: # one node in list
self._firstNode = self._lastNode = None
else:
self._firstNode = self._firstNode._nextNode
return tempNode
def removeFromBack(self):
"""Delete node from back of list"""
if self.isEmpty(): # raise exception on empty list
raise IndexError, "remove from empty list"
tempNode = self._lastNode
if self._firstNode is self._lastNode: # one node in list
self._firstNode = self._lastNode = None
else:
currentNode = self._firstNode
# locate second-to-last node
while currentNode._nextNode is not self._lastNode:
currentNode = currentNode._nextNode
currentNode._nextNode = None
self._lastNode = currentNode
return tempNode
def isEmpty(self):
"""Returns true if List is empty"""
return self._firstNode is None
希望本文所述对大家的Python程序设计有所帮助。
声明：本文内容由网友自发贡献，版权归原作者所有，本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容，请联系admin@php.cn核实处理。
相关文章
相关视频
专题推荐
-
独孤九贱-php全栈开发教程
全栈 170W+
主讲：Peter-Zhu 轻松幽默、简短易学，非常适合PHP学习入门
-
玉女心经-web前端开发教程
入门 80W+
主讲：灭绝师太 由浅入深、明快简洁，非常适合前端学习入门
-
天龙八部-实战开发教程
实战 120W+
主讲：西门大官人 思路清晰、严谨规范，适合有一定web编程基础学习
上一篇： 自定义菜单创建接口
网友评论
文明上网理性发言，请遵守 新闻评论服务协议
我要评论