时间:2021-05-22
本文实例讲述了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
希望本文所述对大家的Python程序设计有所帮助。
声明:本页内容来源网络,仅供用户参考;我单位不保证亦不表示资料全面及准确无误,也不保证亦不表示这些资料为最新信息,如因任何原因,本网内容或者用户因倚赖本网内容造成任何损失或损害,我单位将不会负任何法律责任。如涉及版权问题,请提交至online#300.cn邮箱联系删除。
本文实例讲述了Python实现简单的列表冒泡排序和反转列表操作。分享给大家供大家参考,具体如下:#-*-coding:utf-8-*-#!python2a=[3
本文实例讲述了Python列表解析操作。分享给大家供大家参考,具体如下:列表解析Python的强大特性之一是其对list的解析,它提供一种紧凑的方法,可以通过对
本文实例讲述了Python实现的列表排序、反转操作。分享给大家供大家参考,具体如下:排序:使用sorted方法和列表的sort方法:sorted方法适用范围更广
本文实例讲述了python列表操作之extend和append的区别。分享给大家供大家参考。具体如下:li=['a','b','c']li.extend(['d
本文实例讲述了python通过加号运算符操作列表的方法。分享给大家供大家参考。具体如下:li=['a','b','mpilgrim']li=li+['examp