📌 相关文章
- 数据结构示例-双向链表的末尾删除节点(1)
- 数据结构示例-双向链表的末尾删除节点
- 数据结构示例-单向链表删除末尾节点
- 数据结构示例-单向链表删除末尾节点(1)
- Java程序从循环链表的末尾删除一个节点(1)
- Java程序从循环链表的末尾删除一个节点
- 从给定链表的末尾删除第 N 个节点(1)
- 从给定链表的末尾删除第 N 个节点
- 数据结构示例-删除循环链表的开头节点
- 数据结构示例-删除循环链表的开头节点(1)
- 数据结构示例-删除循环链表中间节点
- 数据结构示例-删除循环链表中间节点(1)
- 数据结构-循环链表
- 数据结构-循环链表(1)
- 数据结构示例-双向链表的末尾插入新节点
- 数据结构示例-双向链表的末尾插入新节点(1)
- 数据结构示例-创建n个节点的循环链表并计算节点数
- 数据结构示例-创建n个节点的循环链表并计算节点数(1)
- 为链表末尾的第 n 个节点编程(1)
- 为链表末尾的第 n 个节点编程
- 数据结构示例-删除循环链表中重复的元素(1)
- 数据结构示例-删除循环链表中重复的元素
- 从循环链表中删除每个第 K 个节点(1)
- 从循环链表中删除每个第 K 个节点
- 数据结构示例-循环链表的开头插入新节点
- 从链表末尾打印第 N 个节点的 C++ 程序
- 数据结构示例-循环链表的中间插入新节点
- 数据结构示例-循环链表的中间插入新节点(1)
- 从循环链表中删除
📜 数据结构示例-删除循环链表的末尾节点
📅 最后修改于: 2020-10-15 06:02:26 🧑 作者: Mango
问：程序从循环链表的末尾删除一个新节点。
说明
在此程序中，我们将创建一个循环链接列表，并从列表末尾删除一个节点。如果列表为空，将显示消息“列表为空”。如果列表不为空，我们将循环浏览列表，直到到达倒数第二个节点。我们将倒数第二个节点作为新的尾巴，而这个新的尾巴将指向头并删除前一个尾巴。
从末端删除节点后的循环链表
在上面的列表中，D是最后一个需要删除的节点。我们将遍历列表直到C。将C设为新尾巴，C指向头A。
算法
- 定义一个Node类，该类代表列表中的一个节点。它具有两个属性数据，下一个将指向下一个节点。
- 定义另一个用于创建循环链接列表的类，它具有两个节点：head和tail。它有两种方法：deleteEnd()和display()。
- deleteEnd()将从列表末尾删除该节点：
- 它首先检查head是否为空(空列表)，然后它将从函数返回，因为列表中没有节点。
- 如果列表不为空，它将检查列表是否只有一个节点。
- 如果列表只有一个节点，则它将head和tail都设置为null。
- 如果列表中有多个节点，则循环遍历直到current.next！= tail。
- 现在，电流将指向尾部之前的节点。使电流成为新的尾巴，然后尾巴将指向头部，从最后删除节点。
- display()将显示列表中存在的所有节点。
- 定义一个新节点“当前”，该节点将指向头部。
- 打印current.data，直到current再次指向head。
- 当前将在每次迭代中指向列表中的下一个节点。
示例：
Python
#Represents the node of list.
class Node:
def __init__(self,data):
self.data = data;
self.next = None;
class CreateList:
#Declaring head and tail pointer as null.
def __init__(self):
self.head = Node(None);
self.tail = Node(None);
self.head.next = self.tail;
self.tail.next = self.head;
#This function will add the new node at the end of the list.
def add(self,data):
newNode = Node(data);
#Checks if the list is empty.
if self.head.data is None:
#If list is empty, both head and tail would point to new node.
self.head = newNode;
self.tail = newNode;
newNode.next = self.head;
else:
#tail will point to new node.
self.tail.next = newNode;
#New node will become new tail.
self.tail = newNode;
#Since, it is circular linked list tail will point to head.
self.tail.next = self.head;
#Deletes node from end of the list
def deleteEnd(self):
#Checks whether list is empty
if(self.head == None):
return;
else:
#Checks whether contain only one element
if(self.head != self.tail ):
current = self.head;
#Loop will iterate till the second last element as current.next is pointing to tail
while(current.next != self.tail):
current = current.next;
#Second last element will be new tail
self.tail = current;
#Tail will point to head as it is a circular linked list
self.tail.next = self.head;
#If the list contains only one element
#Then it will remove it and both head and tail will point to null
else:
self.head = self.tail = None;
#Displays all the nodes in the list
def display(self):
current = self.head;
if self.head is None:
print("List is empty");
return;
else:
#Prints each node by incrementing pointer.
print(current.data),
while(current.next != self.head):
current = current.next;
print(current.data),
print("\n");
class CircularLinkedList:
cl = CreateList();
#Adds data to the list
cl.add(1);
cl.add(2);
cl.add(3);
cl.add(4);
#Printing original list
print("Original List:");
cl.display();
while(cl.head != None):
cl.deleteEnd();
#Printing updated list
print("Updated List:");
cl.display();
输出：
Original List:
1 2 3 4
Updated List:
1 2 3
Updated List:
1 2
Updated List:
1
Updated List:
List is empty
C
#include
#include
#include
//Represents the node of list.
struct node{
int data;
struct node *next;
};
//Declaring head and tail pointer as null.
struct node *head = NULL;
struct node *tail = NULL;
//This function will add the new node at the end of the list.
void add(int data){
//Create new node
struct node *newNode = (struct node*)malloc(sizeof(struct node));
newNode->data = data;
//Checks if the list is empty.
if(head == NULL){
//If list is empty, both head and tail would point to new node.
head = newNode;
tail = newNode;
newNode->next = head;
}else {
//tail will point to new node.
tail->next = newNode;
//New node will become new tail.
tail = newNode;
//Since, it is circular linked list tail will point to head.
tail->next = head;
}
}
//Deletes node from end of the list
void deleteEnd() {
//Checks whether list is empty
if(head == NULL) {
return;
}
else {
//Checks whether contain only one element
if(head != tail ) {
struct node *current = head;
//Loop will iterate till the second last element as current.next is pointing to tail
while(current->next != tail) {
current = current->next;
}
//Second last element will be new tail
tail = current;
//Tail will point to head as it is a circular linked list
tail->next = head;
}
//If the list contains only one element
//Then it will remove it and both head and tail will point to null
else {
head = tail = NULL;
}
}
}
//This function will display the nodes of circular linked list
void display(){
struct node *current = head;
if(head == NULL){
printf("List is empty");
}
else{
do{
//Prints each node by incrementing pointer.
printf("%d ", current->data);
current = current->next;
}while(current != head);
printf("\n");
}
}
int main()
{
//Adds data to the list
add(1);
add(2);
add(3);
add(4);
//Printing original list
printf("Original List:\n ");
display();
while(head != NULL) {
deleteEnd();
//Printing updated list
printf("Updated List:\n ");
display();
}
return 0;
}
输出：
Original List:
1 2 3 4
Updated List:
1 2 3
Updated List:
1 2
Updated List:
1
Updated List:
List is empty
JAVA
public class DeleteEnd {
//Represents the node of list.
public class Node{
int data;
Node next;
public Node(int data) {
this.data = data;
}
}
//Declaring head and tail pointer as null.
public Node head = null;
public Node tail = null;
//This function will add the new node at the end of the list.
public void add(int data){
//Create new node
Node newNode = new Node(data);
//Checks if the list is empty.
if(head == null) {
//If list is empty, both head and tail would point to new node.
head = newNode;
tail = newNode;
newNode.next = head;
}
else {
//tail will point to new node.
tail.next = newNode;
//New node will become new tail.
tail = newNode;
//Since, it is circular linked list tail will point to head.
tail.next = head;
}
}
//Deletes node from end of the list
public void deleteEnd() {
//Checks whether list is empty
if(head == null) {
return;
}
else {
//Checks whether contain only one element
if(head != tail ) {
Node current = head;
//Loop will iterate till the second last element as current.next is pointing to tail
while(current.next != tail) {
current = current.next;
}
//Second last element will be new tail
tail = current;
//Tail will point to head as it is a circular linked list
tail.next = head;
}
//If the list contains only one element
//Then it will remove it and both head and tail will point to null
else {
head = tail = null;
}
}
}
//Displays all the nodes in the list
public void display() {
Node current = head;
if(head == null) {
System.out.println("List is empty");
}
else {
do{
//Prints each node by incrementing pointer.
System.out.print(" "+ current.data);
current = current.next;
}while(current != head);
System.out.println();
}
}
public static void main(String[] args) {
DeleteEnd cl = new DeleteEnd();
//Adds data to the list
cl.add(1);
cl.add(2);
cl.add(3);
cl.add(4);
//Printing original list
System.out.println("Original List: ");
cl.display();
while(cl.head != null) {
cl.deleteEnd();
//Printing updated list
System.out.println("Updated List: ");
cl.display();
}
}
}
输出：
Original List:
1 2 3 4
Updated List:
1 2 3
Updated List:
1 2
Updated List:
1
Updated List:
List is empty
C＃
using System;
namespace CircularLinkedList
{
public class Program
{
//Represents the node of list.
public class Node{
public T data;
public Node next;
public Node(T value) {
data = value;
next = null;
}
}
public class CreateList{
public Node head = null;
public Node tail = null;
//This function will add the new node at the end of the list.
public void add(T data){
//Create new node
Node newNode = new Node(data);
//Checks if the list is empty.
if(head == null){
head = newNode;
tail = newNode;
newNode.next = head;
}else{
//tail will point to new node.
tail.next = newNode;
//New node will become new tail.
tail = newNode;
//Since, it is circular linked list tail will point to head.
tail.next = head;
}
}
//Deletes node from end of the list
public void deleteEnd() {
//Checks whether list is empty
if(head == null) {
return;
}
else {
//Checks whether contain only one element
if(head != tail ) {
Node current = head;
//Loop will iterate till the second last element as current.next is pointing to tail
while(current.next != tail) {
current = current.next;
}
//Second last element will be new tail
tail = current;
//Tail will point to head as it is a circular linked list
tail.next = head;
}
//If the list contains only one element
//Then it will remove it and both head and tail will point to null
else {
head = tail = null;
}
}
}
//Displays all the nodes in the list
public void display(){
Node current = head;
if(head == null){
Console.WriteLine("List is empty");
}
else{
do{
//Prints each node by incrementing pointer.
Console.Write(" "+ current.data);
current = current.next;
}while(current != head);
Console.WriteLine();
}
}
}
public static void Main()
{
CreateList cl = new CreateList();
//Adds data to the list
cl.add(1);
cl.add(2);
cl.add(3);
cl.add(4);
//Printing original list
Console.WriteLine("Original List: ");
cl.display();
while(cl.head != null) {
cl.deleteEnd();
//Printing updated list
Console.WriteLine("Updated List: ");
cl.display();
}
}
}
}
输出：
Original List:
1 2 3 4
Updated List:
1 2 3
Updated List:
1 2
Updated List:
1
Updated List:
List is empty
PHP：
data = $data;
$this->next = NULL;
}
}
class CreateList{
//Declaring head and tail pointer as null.
public $head;
public $tail;
function __construct(){
$this->head = NULL;
$this->tail = NULL;
}
//This function will add the new node at the end of the list.
function add($data){
//Create new node
$newNode = new Node($data);
//Checks if the list is empty.
if($this->head == NULL){
//If list is empty, both head and tail would point to new node.
$this->head = $newNode;
$this->tail = $newNode;
$newNode->next = $this->head;
}
else{
//tail will point to new node.
$this->tail->next = $newNode;
//New node will become new tail.
$this->tail = $newNode;
//Since, it is circular linked list tail will point to head.
$this->tail->next = $this->head;
}
}
//Deletes node from end of the list
function deleteEnd() {
//Checks whether list is empty
if($this->head == NULL) {
return;
}
else {
//Checks whether contain only one element
if($this->head != $this->tail ) {
$current = $this->head;
//Loop will iterate till the second last element as current.next is pointing to tail
while($current->next != $this->tail) {
$current = $current->next;
}
//Second last element will be new tail
$this->tail = $current;
//Tail will point to head as it is a circular linked list
$this->tail->next = $this->head;
}
//If the list contains only one element
//Then it will remove it and both head and tail will point to null
else {
$this->head = $this->tail = NULL;
}
}
}
//Displays all the nodes in the list
function display() {
$current = $this->head;
if($this->head == NULL) {
echo "List is empty";
}
else {
do{
//Prints each node by incrementing pointer.
echo(" $current->data");
$current = $current->next;
}while($current != $this->head);
echo "
";
}
}
}
$cl = new CreateList();
//Adds data to the list
$cl->add(1);
$cl->add(2);
$cl->add(3);
$cl->add(4);
//Printing original list
echo "Original List:
";
$cl->display();
while($cl->head != NULL) {
$cl->deleteEnd();
//Printing updated list
echo "Updated List:
";
$cl->display();
}
?>
输出：
Original List:
1 2 3 4
Updated List:
1 2 3
Updated List:
1 2
Updated List:
1
Updated List:
List is empty