对单链表元素进行排序的程序

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

说明

在此程序中，我们需要对给定的单链表节点进行升序排序。

原始列表

Program to sort the elements of the singly linked list

已排序列表

为了完成此任务，我们维护两个指针：current 和 index。初始时，current 指向头节点，index 指向 current 后面的节点。遍历列表直到 current 指向 null，通过比较 current 的数据与 index 的数据。如果 current 的数据大于 index 的数据，则交换它们之间的数据。在上面的示例中，current 最初指向 9，index 指向 7。由于 9 大于 7，交换数据。继续此过程，直到整个列表按升序排序。

算法

创建一个名为 Node 的类，它有两个属性：data 和 next。Next 是指向链表中下一个节点的指针。
创建另一个名为 SortList 的类，它有两个属性：head 和 tail。
addNode() 将向列表添加一个新节点
1. 创建一个新节点。
2. 它首先检查 head 是否等于 null，这意味着列表为空。
3. 如果列表为空，则 head 和 tail 都将指向新添加的节点。
4. 如果列表不为空，新节点将添加到列表末尾，使得 tail 的 next 指向新添加的节点。此新节点将成为列表的新 tail。
sortList() 将对列表节点进行升序排序。
1. 定义一个节点 current，它将指向 head。
2. 定义另一个节点 index，它将指向 current 后面的节点。
3. 比较 current 节点和 index 节点的数据。如果 current 的数据大于 index 的数据，则交换它们之间的数据。
4. Current 将指向 current.next，index 将指向 index.next。
5. 继续此过程，直到整个列表排序完成。
display() 将显示列表中存在的节点
1. 定义一个节点 current，它最初将指向列表的 head。
2. 遍历列表直到 current 指向 null。
3. 通过使 current 在每次迭代中指向它的下一个节点来显示每个节点。

解决方案

Python

#Represent a node of the singly linked list
class Node:
    def __init__(self,data):
        self.data = data;
        self.next = None;
        
class SortList:
    #Represent the head and tail of the singly linked list
    def __init__(self):
        self.head = None;
        self.tail = None;
        
    #addNode() will add a new node to the list
    def addNode(self, data):
        #Create a new node
        newNode = Node(data);
        
        #Checks if the list is empty
        if(self.head == None):
            #If list is empty, both head and tail will point to new node
            self.head = newNode;
            self.tail = newNode;
        else:
            #newNode will be added after tail such that tail's next will point to newNode
            self.tail.next = newNode;
            #newNode will become new tail of the list
            self.tail = newNode;
            
    #sortList() will sort nodes of the list in ascending order
    def sortList(self):
        #Node current will point to head
        current = self.head;
        index = None;
        
        if(self.head == None):
            return;
        else:
            while(current != None):
                #Node index will point to node next to current
                index = current.next;
                
                while(index != None):
                    #If current node's data is greater than index's node data, swap the data between them
                    if(current.data > index.data):
                        temp = current.data;
                        current.data = index.data;
                        index.data = temp;
                    index = index.next;
                current = current.next;
                
    #display() will display all the nodes present in 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 ""
 
sList = SortList();
        
#Adds data to the list
sList.addNode(9);
sList.addNode(7);
sList.addNode(2);
sList.addNode(5);
sList.addNode(4);
 
#Displaying original list
print("Original list: ");
sList.display();

#Sorting list
sList.sortList();
 
#Displaying sorted list
print("Sorted list: ");
sList.display();

输出

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

C

#include <stdio.h>
 
//Represent a node of the singly linked list
struct node{
    int data;
    struct node *next;
};    
 
//Represent the head and tail of the singly linked list
struct node *head, *tail = NULL;
 
//addNode() will add a new node to the list
void addNode(int data) {
    //Create a new node
    struct node *newNode = (struct node*)malloc(sizeof(struct node));
    newNode->data = data;
    newNode->next = NULL;
    
    //Checks if the list is empty
    if(head == NULL) {
        //If list is empty, both head and tail will point to new node
        head = newNode;
        tail = newNode;
    }
    else {
        //newNode will be added after tail such that tail's next will point to newNode
        tail->next = newNode;
        //newNode will become new tail of the list
        tail = newNode;
    }
}
 
    //sortList() will sort nodes of the list in ascending order
    void sortList() {
        //Node current will point to head
        struct node *current = head, *index = NULL;
        int temp;
        
        if(head == NULL) {
            return;
        }
        else {
            while(current != NULL) {
                //Node index will point to node next to current
                index = current->next;
                
                while(index != NULL) {
                    //If current node's data is greater than index's node data, swap the data between them
                    if(current->data > index->data) {
                        temp = current->data;
                        current->data = index->data;
                        index->data = temp;
                    }
                    index = index->next;
                }
                current = current->next;
            }    
        }
    }
 
//display() will display all the nodes present in 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()
{
    //Adds data to the list
    addNode(9);
    addNode(7);
    addNode(2);
    addNode(5);
    addNode(4);
    
    //Displaying original list
    printf("Original list: \n");
    display();
    
    //Sorting list
    sortList();
    
    //Displaying sorted list
    printf("Sorted list: \n");
    display();
        
    return 0;
}

输出

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

JAVA

public class SortList {
    
    //Represent a node of the singly linked list
    class Node{
        int data;
        Node next;
        
        public Node(int data) {
            this.data = data;
            this.next = null;
        }
    }
 
    //Represent the head and tail of the singly linked list
    public Node head = null;
    public Node tail = null;
    
    //addNode() will add a new node to the list
    public void addNode(int data) {
        //Create a new node
        Node newNode = new Node(data);
        
        //Checks if the list is empty
        if(head == null) {
            //If list is empty, both head and tail will point to new node
            head = newNode;
            tail = newNode;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            tail.next = newNode;
            //newNode will become new tail of the list
            tail = newNode;
        }
    }
    
    //sortList() will sort nodes of the list in ascending order
    public void sortList() {
        //Node current will point to head
        Node current = head, index = null;
        int temp;
        
        if(head == null) {
            return;
        }
        else {
            while(current != null) {
                //Node index will point to node next to current
                index = current.next;
                
                while(index != null) {
                    //If current node's data is greater than index's node data, swap the data between them
                    if(current.data > index.data) {
                        temp = current.data;
                        current.data = index.data;
                        index.data = temp;
                    }
                    index = index.next;
                }
                current = current.next;
            }    
        }
    }
    
    //display() will display all the nodes present in 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 pointer
            System.out.print(current.data + " ");
            current = current.next;
        }
        System.out.println();
    }
    
    public static void main(String[] args) {
        
        SortList sList = new SortList();
        
        //Adds data to the list
        sList.addNode(9);
        sList.addNode(7);
        sList.addNode(2);
        sList.addNode(5);
        sList.addNode(4);
        
        //Displaying original list
        System.out.println("Original list: ");
        sList.display();
        
        //Sorting list
        sList.sortList();
        
        //Displaying sorted list
        System.out.println("Sorted list: ");
        sList.display();
    }
}

输出

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

C#

using System;
                    
public class CreateList
{
    //Represent a node of the singly linked list
    public class Node<T>{
        public T data;
        public Node<T> next;
        
        public Node(T value) {
            data = value;
            next = null;
        }
    }
        
    public class SortList<T> where T : IComparable<T>{
        //Represent the head and tail of the singly linked list
        public Node<T> head = null;             
         public Node<T> tail = null;
    
        //addNode() will add a new node to the list
        public void addNode(T data) {
            //Create a new node
            Node<T> newNode = new Node<T>(data);
 
            //Checks if the list is empty
            if(head == null) {
                //If list is empty, both head and tail will point to new node
                head = newNode;
                tail = newNode;
            }
            else {
                //newNode will be added after tail such that tail's next will point to newNode
                tail.next = newNode;
                //newNode will become new tail of the list
                tail = newNode;
            }
        }
    
        //sortList() will sort nodes of the list in ascending order
        public void sortList() {
            //Node current will point to head
            Node<T> current = head, index = null;
            T temp;
 
            if(head == null) {
                return;
            }
            else {
                while(current != null) {
                    //Node index will point to node next to current
                    index = current.next;
 
                    while(index != null) {
                        //If current node's data is greater than index's node data, swap the data between them
                        if(current.data.CompareTo(index.data) > 0) {
                            temp = current.data;
                            current.data = index.data;
                            index.data = temp;
                        }
                        index = index.next;
                    }
                    current = current.next;
                }    
            }
        }
        
        //display() will display all the nodes present in 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 pointer
                Console.Write(current.data + " ");
                current = current.next;
            }
            Console.WriteLine();
        }
    }
    
    public static void Main()
    {
        SortList<int> sList = new SortList<int>();
        
        //Adds data to the list
        sList.addNode(9);
        sList.addNode(7);
        sList.addNode(2);
        sList.addNode(5);
        sList.addNode(4);
        
        //Displaying original list
        Console.WriteLine("Original list: ");
        sList.display();
        
        //Sorting list
        sList.sortList();
        
        //Displaying sorted list
        Console.WriteLine("Sorted list: ");
        sList.display();
    }
}

输出

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

PHP

<!DOCTYPE html>
<html>
<body>
<?php
//Represent a node of singly linked list
class Node{
    public $data;
    public $next;
    
    function __construct($data){
        $this->data = $data;
        $this->next = NULL;
    }
}
class SortList{
    //Represent the head and tail of the singly linked list
    public $head;
    public $tail;
    function __construct(){
        $this->head = NULL;
        $this->tail = NULL;
    }
    
    //addNode() will add a new node to the list
    function addNode($data) {
        //Create a new node
        $newNode = new Node($data);
        
        //Checks if the list is empty
        if($this->head == NULL) {
            //If list is empty, both head and tail will point to new node
            $this->head = $newNode;
            $this->tail = $newNode;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            $this->tail->next = $newNode;
            //newNode will become new tail of the list
            $this->tail = $newNode;
        }
    }
    
    //sortList() will sort nodes of the list in ascending order
    function sortList() {
        //Node current will point to head
        $current = $this->head; 
        $index = null;
        
        if($this->head == null) {
            return;
        }
        else {
            while($current != null) {
                //Node index will point to node next to current
                $index = $current->next;
                
                while($index != null) {
                    //If current node's data is greater than index's node data, swap the data between them
                    if($current->data > $index->data) {
                        $temp = $current->data;
                        $current->data = $index->data;
                        $index->data = $temp;
                    }
                    $index = $index->next;
                }
                $current = $current->next;
            }    
        }
    }
    
    //display() will display all the nodes present in 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>");
    }
}
    
$sList = new SortList();
        
//Adds data to the list
$sList->addNode(9);
$sList->addNode(7);
$sList->addNode(2);
$sList->addNode(5);
$sList->addNode(4);
 
//Displaying original list
print("Original list: <br>");
$sList->display();
 
//Sorting list
$sList->sortList();
 
//Displaying sorted list
print("Sorted list: <br>");
$sList->display();
?>
</body>
</html>

输出

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

下一主题#

对单链表元素进行排序的程序

说明

算法

解决方案

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

相关帖子

查找字符串反转的程序

查找数组中每个元素出现频率的程序

打印图案 7 的程序

计算圆锥体积的程序

编写计算菱形面积的程序

从循环链表末尾删除新节点的程序

查找字符串的所有可能子集的程序

确定单向链表是否为回文串的程序

根据给定坐标查找三角形类型的程序

计算三角形面积的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器