本文介绍了一个Python初学者在构建和操作双重链表（SortedDoublyLL）时遇到的问题，通过实例代码演示了如何创建节点、排序和初始化链表。重点在于理解链表的双向链接结构和相关操作。
我在理解和实现双重链接列表时遇到了困难。我能掌握链表的大部分概念。以下是我目前为止的代码(用Python编写)
*这是纯粹的学术练习。我通常使用list和dictclass DoublyNode(object):
"""A node of the SortedDoublyLL object.
DoublyNode(item, next=None, previous=None) -> a new DoublyNode with data as
its data, and next and previous as its neighbors."""
def __init__(self, data, next = None, previous = None):
"""Make a new DoublyNode from item, pointing to next and previous."""
self.data = data
self.next = next
self.previous = previous
class SortedDoublyLL(object):
"""A Sorted Doubly Linked List.
SortedDoublyLL() -> new SortedDoublyLL list that is empty
SortedDoublyLL(sequence) -> a SortedDoublyLL initialized from sequence's
items.
"""
def __init__(self, sequence = []):
"""Make a new SortedDoublyLL from the elements of sequence."""
if len(sequence) == 0:
self.head = None
self.tail = None
else:
cur_node = None
prev_node = None
sequence.sort()
sequence.reverse()
for element in sequence:
prev_node = cur_node
cur_node = DoublyNode(element, cur_node, prev_node)
self.head = cur_node
self.tail = DoublyNode(sequence[0])
扫一扫
499
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
