问。对双向链表元素进行排序的程序。

2025年03月17日 | 阅读 9 分钟

说明

在此程序中，我们将创建一个双向链表，并将链表的节点按升序排序。

原始列表

Program to sort the elements of the doubly linked list

已排序列表

为了实现这一点，我们维护两个指针：current（当前）和index（索引）。最初，current指向head节点，index将指向current之后的节点。通过比较current的数据与index的数据，遍历链表直到current指向null。如果current的数据大于index的数据，则交换它们之间的数据。在上面的示例中，current最初将指向7，index将指向1。由于7大于1，因此交换数据。继续此过程，直到整个链表按升序排序。

算法

定义一个 Node 类，它表示列表中的一个节点。它将有三个属性：数据、previous 指向前一个节点，以及 next 指向下一个节点。
定义另一个用于创建双向链表的类，它有两个节点：头节点和尾节点。最初，头节点和尾节点将指向 null。
addNode() 将向列表中添加节点。
1. 它首先检查头节点是否为 null，然后将节点作为头节点插入。
2. 头节点和尾节点都将指向新添加的节点。
3. 头节点的前一个指针将指向 null，尾节点的下一个指针将指向 null。
4. 如果头节点不为 null，则新节点将插入到列表的末尾，使得新节点的前一个指针将指向尾节点。
5. 新节点将成为新的尾节点。尾节点的下一个指针将指向 null。
sortList() 将按升序对列表节点进行排序。
1. 定义一个节点 current，它将指向 head。
2. 定义另一个节点 index，它将指向 current 后面的节点。
3. 比较current和index节点的数据。如果current的数据大于index的数据，则交换它们之间的数据。
4. Current 将指向 current.next，index 将指向 index.next。
5. 继续此过程，直到整个列表排序完毕。
display() 将显示列表中存在的所有节点。
1. 定义一个新节点“current”，它将指向头节点。
2. 打印 current.data 直到 current 指向 null。
3. 在每次迭代中，current 将指向列表中的下一个节点。

解决方案

Python

#Represent a node of doubly linked list
class Node:
    def __init__(self,data):
        self.data = data;
        self.previous = None;
        self.next = None;
        
class SortList:
    #Represent the head and tail of the doubly linked list
    def __init__(self):
        self.head = None;
        self.tail = None;
        
    #addNode() will add a node to the list
    def addNode(self, data):
        #Create a new node
        newNode = Node(data);
        
        #If list is empty
        if(self.head == None):
            #Both head and tail will point to newNode
            self.head = self.tail = newNode;
            #head's previous will point to None
            self.head.previous = None;
            #tail's next will point to None, as it is the last node of the list
            self.tail.next = None;
        else:
            #newNode will be added after tail such that tail's next will point to newNode
            self.tail.next = newNode;
            #newNode's previous will point to tail
            newNode.previous = self.tail;
            #newNode will become new tail
            self.tail = newNode;
            #As it is last node, tail's next will point to None
            self.tail.next = None;
            
    #sortList() will sort the given list in ascending order
    def sortList(self):
        #Check whether list is empty
        if(self.head == None):
            return;
        else:
            #Current will point to head
            current = self.head
            while(current.next != None):
                #Index will point to node next to current
                index = current.next;
                while(index != None):
                    #If current's data is greater than index's data, swap the data of current and index
                    if(current.data > index.data):
                        temp = current.data;
                        current.data = index.data;
                        index.data = temp;
                    index = index.next
                current = current.next
                
    #display() will print out the nodes of the list
    def display(self):
        #Node current will point to head
        current = self.head;
        if(self.head == None):
            print("List is empty");
            return;
        while(current != None):
            #Prints each node by incrementing pointer.
            print(current.data),
            current = current.next;
            
        print();
        
dList = SortList();
#Add nodes to the list
dList.addNode(7);
dList.addNode(1);
dList.addNode(4);
dList.addNode(5);
dList.addNode(2);
 
#Displaying original list
print("Original list: ");
dList.display();
 
#Sorting list
dList.sortList();
 
#Displaying a sorted list

print("Sorted list: ");
dList.display();

输出

Original list: 
7 1 4 5 2 
Sorted list: 
1 2 4 5 7

C

#include <stdio.h>
 
//Represent a node of the doubly linked list

struct node{
    int data;
    struct node *previous;
    struct node *next;
};    
 
//Represent the head and tail of the doubly linked list
struct node *head, *tail = NULL;
 
//addNode() will add a node to the list
void addNode(int data) {
    //Create a new node
    struct node *newNode = (struct node*)malloc(sizeof(struct node));
    newNode->data = data;
    
    //If list is empty
    if(head == NULL) {
        //Both head and tail will point to newNode
        head = tail = newNode;
        //head's previous will point to NULL
        head->previous = NULL;
        //tail's next will point to NULL, as it is the last node of the list
        tail->next = NULL;
    }
    else {
        //newNode will be added after tail such that tail's next will point to newNode
        tail->next = newNode;
        //newNode's previous will point to tail
        newNode->previous = tail;
        //newNode will become new tail
        tail = newNode;
        //As it is last node, tail's next will point to NULL
        tail->next = NULL;
    }
}
 
//sortList() will sort the given list in ascending order
void sortList() {
    struct node *current = NULL, *index = NULL;
    int temp;
    //Check whether list is empty
    if(head == NULL) {
        return;
    }
    else {
        //Current will point to head
        for(current = head; current->next != NULL; current = current->next) {
            //Index will point to node next to current
            for(index = current->next; index != NULL; index = index->next) {
                //If current's data is greater than index's data, swap the data of current and index
                if(current->data > index->data) {
                    temp = current->data;
                    current->data = index->data;
                    index->data = temp;
                }
            }
        }
    }
}
 
//display() will print out the nodes of the list
void display() {
    //Node current will point to head
    struct node *current = head;
    if(head == NULL) {
        printf("List is empty\n");
        return;
    }
    while(current != NULL) {
        //Prints each node by incrementing pointer.
        printf("%d ",current->data);
        current = current->next;
    }
    printf("\n");
}
 
int main()
{
    //Add nodes to the list
    addNode(7);
    addNode(1);
    addNode(4);
    addNode(5);
    addNode(2);
    
    //Displaying original list
    printf("Original list: \n");
    display();
    
    //Sorting list
    sortList();
    
    //Displaying sorted list
    printf("Sorted list: \n");
    display();
 
    return 0;
}

输出

Original list: 
7 1 4 5 2 
Sorted list: 
1 2 4 5 7

JAVA

public class SortList {
    
    //Represent a node of the doubly linked list

    class Node{
        int data;
        Node previous;
        Node next;
        
        public Node(int data) {
            this.data = data;
        }
    }
    
    //Represent the head and tail of the doubly linked list
    Node head, tail = null;
    
    //addNode() will add a node to the list
    public void addNode(int data) {
        //Create a new node
        Node newNode = new Node(data);
        
        //If list is empty
        if(head == null) {
            //Both head and tail will point to newNode
            head = tail = newNode;
            //head's previous will point to null
            head.previous = null;
            //tail's next will point to null, as it is the last node of the list
            tail.next = null;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            tail.next = newNode;
            //newNode's previous will point to tail
            newNode.previous = tail;
            //newNode will become new tail
            tail = newNode;
            //As it is last node, tail's next will point to null
            tail.next = null;
        }
    }
    
    //sortList() will sort the given list in ascending order
    public void sortList() {
        Node current = null, index = null;
        int temp;
        //Check whether list is empty
        if(head == null) {
            return;
        }
        else {
            //Current will point to head
            for(current = head; current.next != null; current = current.next) {
                //Index will point to node next to current
                for(index = current.next; index != null; index = index.next) {
                    //If current's data is greater than index's data, swap the data of current and index
                    if(current.data > index.data) {
                        temp = current.data;
                        current.data = index.data;
                        index.data = temp;
                    }
                }
            }
        }
    }
    
    //display() will print out the nodes of the list
    public void display() {
        //Node current will point to head
        Node current = head;
        if(head == null) {
            System.out.println("List is empty");
            return;
        }
        while(current != null) {
            //Prints each node by incrementing the pointer.

            System.out.print(current.data + " ");
            current = current.next;
        }
        System.out.println();
    }
    
    public static void main(String[] args) {
        
        SortList dList = new SortList();
        //Add nodes to the list
        dList.addNode(7);
        dList.addNode(1);
        dList.addNode(4);
        dList.addNode(5);
        dList.addNode(2);
        
        //Displaying original list
        System.out.println("Original list: ");
        dList.display();
        
        //Sorting list
        dList.sortList();
        
        //Displaying sorted list
        System.out.println("Sorted list: ");
        dList.display();
    }
}

输出

Original list: 
7 1 4 5 2 
Sorted list: 
1 2 4 5 7

C#

using System; 
namespace DoublyLinkedList 
{                     
    public class Program
    {
        //Represent a node of the doubly linked list

        public class Node<T>{
            public T data;
            public Node<T> previous;
            public Node<T> next;
            
            public Node(T value) {
                data = value;
            }
        }
        
        public class SortList<T> where T : IComparable<T>{
            //Represent the head and tail of the doubly linked list
            protected Node<T> head = null;             
             protected Node<T> tail = null;
            
            //addNode() will add a node to the list
            public void addNode(T data) {
                //Create a new node
                Node<T> newNode = new Node<T>(data);
 
                //If list is empty
                if(head == null) {
                    //Both head and tail will point to newNode
                    head = tail = newNode;
                    //head's previous will point to null
                    head.previous = null;
                    //tail's next will point to null, as it is the last node of the list
                    tail.next = null;
                }
                else {
                    //newNode will be added after tail such that tail's next will point to newNode
                    tail.next = newNode;
                    //newNode's previous will point to tail
                    newNode.previous = tail;
                    //newNode will become new tail
                    tail = newNode;
                    //As it is last node, tail's next will point to null
                    tail.next = null;
                }
            }
            
            //sortList() will sort the given list in ascending order
            public void sortList() {
                Node<T> current = null, index = null;
                T temp;
                //Check whether list is empty
                if(head == null) {
                    return;
                }
                else {
                    //Current will point to head
                    for(current = head; current.next != null; current = current.next) {
                        //Index will point to node next to current
                        for(index = current.next; index != null; index = index.next) {
                            //If current's data is greater than index's data, swap the data of current and index
                            if(current.data.CompareTo(index.data) > 0) {
                                temp = current.data;
                                current.data = index.data;
                                index.data = temp;
                            }
                        }
                    }
                }
            }
 
            //display() will print out the nodes of the list
            public void display() {
                //Node current will point to head
                Node<T> current = head;
                if(head == null) {
                    Console.WriteLine("List is empty");
                    return;
                }
                while(current != null) {
                    //Prints each node by incrementing the pointer.

                    Console.Write(current.data + " ");
                    current = current.next;
                }
                Console.WriteLine();
            }
 
        }
        
        public static void Main()
        {
            SortList<int> dList = new SortList<int>();
            //Add nodes to the list
            dList.addNode(7);
            dList.addNode(1);
            dList.addNode(4);
            dList.addNode(5);
            dList.addNode(2);
 
            //Displaying original list
            Console.WriteLine("Original list: ");
            dList.display();
 
            //Sorting list
            dList.sortList();
 
            //Displaying sorted list
            Console.WriteLine("Sorted list: ");
            dList.display();
        }    
    }
}

输出

Original list: 
7 1 4 5 2 
Sorted list: 
1 2 4 5 7

PHP

<!DOCTYPE html>
<html>
<body>
<?php
//Represent a node of doubly linked list
class Node{
    public $data;
    public $previous;
    public $next;
    
    function __construct($data){
        $this->data = $data;
    }
}
class SortList{
    //Represent the head and tail of the doubly linked list
    public $head;
    public $tail;
    function __construct(){
        $this->head = NULL;
        $this->tail = NULL;
    }
    
    //addNode() will add a node to the list
    function addNode($data){
        //Create a new node
        $newNode = new Node($data);
        
        //If list is empty
        if($this->head == NULL) {
            //Both head and tail will point to newNode
            $this->head = $this->tail = $newNode;
            //head's previous will point to NULL
            $this->head->previous = NULL;
            //tail's next will point to NULL, as it is the last node of the list
            $this->tail->next = NULL;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            $this->tail->next = $newNode;
            //newNode's previous will point to tail
            $newNode->previous = $this->tail;
            //newNode will become new tail
            $this->tail = $newNode;
            //As it is last node, tail's next will point to NULL
            $this->tail->next = NULL;
        }
    }
    
    //sortList() will sort the given list in ascending order
    function sortList() {
        //Check whether list is empty
        if($this->head == NULL) {
            return;
        }
        else {
            //Current will point to head
            for($current = $this->head; $current->next != NULL; $current = $current->next) {
                //Index will point to node next to current
                for($index = $current->next; $index != NULL; $index = $index->next) {
                    //If current's data is greater than index's data, swap the data of current and index
                    if($current->data > $index->data) {
                        $temp = $current->data;
                        $current->data = $index->data;
                        $index->data = $temp;
                    }
                }
            }
        }
    }
    
    //display() will print out the nodes of the list
    function display() {
        //Node current will point to head
        $current = $this->head;
        if($this->head == NULL) {
            print("List is empty <br>");
            return;
        }
        while($current != NULL) {
            //Prints each node by incrementing pointer.
            print($current->data . " ");
            $current = $current->next;
        }
        print("<br>");
    }
}
    
$dList = new SortList();
//Add nodes to the list
$dList->addNode(7);
$dList->addNode(1);
$dList->addNode(4);
$dList->addNode(5);
$dList->addNode(2);
 
//Displaying original list
print("Original list: <br>");
$dList->display();
 
//Sorting list
$dList->sortList();
 
//Displaying sorted list
print("Sorted list: <br>");
$dList->display();
?>
</body>
</html>

输出

Original list: 
7 1 4 5 2 
Sorted list: 
1 2 4 5 7

下一主题#

问。对双向链表元素进行排序的程序。

说明

算法

解决方案

Python

C

JAVA

C#

PHP

联系信息

关注我们

教程

面试题

在线编译器

Python

Java

.Net Framework

AI, ML and Data Science

Cloud Technology

B.Tech and MCA

Web Technology

PHP

Software Testing

Technical Interview

Java Interview

Python

Web Interview

Database Interview

B.Tech / MCA

Important Interview

Software Testing Interview

Company Interviews

Online Compilers

Multiple Choice Questions

程序

问。对双向链表元素进行排序的程序。

说明

算法

解决方案

Python

C

JAVA

C#

PHP

相关帖子

不使用第三个或临时变量交换两个字符串变量的程序

在循环链表中搜索元素的程序

计算直角三角形面积的程序

将英尺转换为厘米的程序

反向打印数组元素的程序

打印数字图案 13 的程序

不交换数据交换单链表中节点的程序

创建包含 N 个节点的循环链表并以反向顺序显示的程序

打印 1 到 100 之间的所有普罗尼克数（Pronic number）的程序

华氏度转摄氏度的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器