Python程序从双向链表开头删除新节点
当需要从双向链表的开头删除节点时,需要创建一个“节点”类。在这个类中,有三个属性:节点中存在的数据、对链表中下一个节点的访问以及对链表中上一个节点的访问。
以下是相同内容的演示 -
示例
class Node: def __init__(self, my_data): self.prev = None self.data = my_data self.next = None class double_list: def __init__(self): self.head = None self.tail = None def add_data(self, my_data): new_node = Node(my_data) if(self.head == None): self.head = self.tail = new_node; self.head.previous = None; self.tail.next = None; else: self.tail.next = new_node; new_node.previous = self.tail; self.tail = new_node; self.tail.next = None; def print_it(self): curr = self.head if (self.head == None): print("The list is empty") return print("The nodes in the doubly linked list are :") while curr != None: print(curr.data) curr = curr.next def delete_from_beginning(self): if(self.head == None): return; else: if(self.head != self.tail): self.head = self.head.next; self.head.previous = None; else: self.head = self.tail = None; my_instance = double_list() print("Elements are being added to the doubly linked list") my_instance.add_data(10) my_instance.add_data(24) my_instance.add_data(54) my_instance.add_data(77) my_instance.add_data(92) my_instance.print_it() while(my_instance.head != None): my_instance.delete_from_beginning(); print("The list after deleting the element from the beginning is : "); my_instance.print_it();
输出
Elements are being added to the doubly linked list The nodes in the doubly linked list are : 10 24 54 77 92 The list after deleting the element from the beginning is : The nodes in the doubly linked list are : 24 54 77 92 The list after deleting the element from the beginning is : The nodes in the doubly linked list are : 54 77 92 The list after deleting the element from the beginning is : The nodes in the doubly linked list are : 77 92 The list after deleting the element from the beginning is : The nodes in the doubly linked list are : 92 The list after deleting the element from the beginning is : The list is empty
解释
- 创建“节点”类。
- 创建另一个具有所需属性的类。
- 定义一个名为“add_data”的方法,用于将数据添加到双向链表。
- 定义另一个名为“print_it”的方法,用于显示循环链表的节点。
- 定义另一个名为“delete_from_beginning”的方法,该方法从开头删除节点,即“头”节点,并将下一个节点作为循环链表中的头节点。
- 创建一个“double_list”类的对象,并在其上调用方法以从双向链表的开头删除节点。
- 定义一个“init”方法,将双向链表的根、头和尾节点设置为None。
- 遍历列表,并从开头删除每个节点,直到列表为空。
- 使用“print_it”方法在控制台上显示结果。
广告