问。排序循环链表元素的程序。

2025年1月8日 | 阅读 8 分钟

说明

在本程序中，我们将创建一个循环链表并将列表升序排序。在此示例中，我们维护两个节点：current 将指向 head，index 将指向 current 的下一个节点。第一个循环跟踪 current，第二个循环跟踪 index。在第一次迭代中，current 将指向 9。index 将指向 current 后面的节点，在本例中是 5。将 9 与 5 进行比较，因为 9 > 5，交换 index 节点的数据与 current 节点的数据。现在，current 将具有 5。现在，将 5 与 2 进行比较。再次 5 > 2，交换数据。现在 current 将保存 2，index 将保存 7。2 < 7，不执行任何操作。index 将递增并指向 3。2 < 3。不执行任何操作。通过这种方式，第一个位置将有一个最小值的节点。然后，我们将继续在列表的其余部分查找最小元素，直到列表完全排序。

9->5->2->7->3
2->9->5->7->3
2->3->9->7->5
2->3->5->9->7
2->3->5->7->9

算法

定义一个 Node 类，它表示列表中的一个节点。它有两个属性 data 和 next，next 将指向下一个节点。
定义另一个类来创建循环链表，它有两个节点：head 和 tail。
sortList() 将对列表进行排序
1. 我们将维护两个节点：current 指向 head，index 指向 current 的下一个节点。
2. 从 index 开始遍历列表，直到到达末尾。
3. 如果 current.data 大于 index.data，则交换它们之间的数据。
4. 在第一次迭代中，我们将在列表的开头得到最小的元素。
5. 然后 current 将指向 current.next。
6. 重复步骤 b 到 e，直到找到下一个最小节点。
7. 两个循环结束后，列表将被排序。

解决方案

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;
    
    #This function sorts the list in ascending order
    def sortList(self):
        #Current will point to head
        current = self.head;
        if(self.head == None):
            print("List is empty");
        else:
            while(True):
                #Index will point to node next to current
                index = current.next;
                while(index != self.head):
                    #If current node is greater than index data, swaps the data
                    if(current.data > index.data):
                        temp = current.data;
                        current.data = index.data;
                        index.data = temp;
                    index= index.next;
                current =current.next;
                if(current.next == self.head):
                    break;
                    
    #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, end= ' ');
            while(current.next != self.head):
                current = current.next;
                print(current.data,end=' ');
        print("\n");
            
class CircularLinkedList:
    cl = CreateList();
    #Adds data to the list
    cl.add(70);
    cl.add(90);
    cl.add(20);
    cl.add(100);
    cl.add(50);
    
    #Displaying original list
    print("Original list: ");
    cl.display();
    
    #Sorting list
    cl.sortList();
    
    #Displaying sorted list
    print("Sorted list: ");
    cl.display();

输出

Original list: 
 70 90 20 100 50
Sorted list: 
 20 50 70 90 100

C

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

//Represents the node of the 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;
}
}

//This function sorts the list in ascending order
void sortList() {
//Current will point to head
struct node *current = head, *index = NULL;
int temp;
if(head == NULL) {
printf("List is empty");
}
else {
do{
//Index will point to node next to current
index = current->next;
while(index != head) {
//If current node is greater than index data, swaps the data
if(current->data > index->data) {
temp =current->data;
current->data= index->data;
index->data = temp;
}
index= index->next;
}
current =current->next;
}while(current->next != head); 
}
}
//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(70);
   add(90);
   add(20);
   add(100);
   add(50);
   //Displaying original list
   printf("Original list: \n");
   display();
   //Sorting list
   sortList();
   //Displaying sorted list
   printf("Sorted list: \n");
   display();
   
   return 0;
}

输出

Original list: 
 70 90 20 100 50
Sorted list: 
 20 50 70 90 100

JAVA

public class SortList {
//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 points to head.
tail.next = head;
}
}
//This function sorts the list in ascending order
public void sortList() {
//Current will point to head
Node current = head, index = null;
int temp;
if(head == null) {
System.out.println("List is empty");
}
else {
do{
//Index will point to node next to current
index = current.next;
while(index != head) {
//If current node is greater than index data, swaps the data
if(current.data > index.data) {
temp =current.data;
current.data= index.data;
index.data = temp;
}
index= index.next;
}
current =current.next;
}while(current.next != head); 
}
}
//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) {
SortList cl = new SortList();
//Adds data to the list
cl.add(70);
cl.add(90);
cl.add(20);
cl.add(100);
cl.add(50);
//Displaying original list
System.out.println("Original list: ");
cl.display();
//Sorting list
cl.sortList();
//Displaying sorted list
System.out.println("Sorted list: ");
cl.display();
}
}

输出

Original list: 
 70 90 20 100 50
Sorted list: 
 20 50 70 90 100

C#

using System; 
namespace CircularLinkedList 
{  
public class Program
{
//Represents the node of list.
public class Node<T>{
public T data;
public Node<T> next;
public Node(T value) {
data = value;
next = null;
}
}
public class CreateList<T>  where T : IComparable<T> {
protected Node<T> head = null;             
  protected Node<T> tail = null;
//This function will add the new node at the end of the list.
public void add(T data){
//Create new node
Node<T> newNode = new Node<T>(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;
}
}
//This function sorts the list in ascending order
public void sortList() {
//Current will point to head
Node<T> current = head, index = null;
T temp;
if(head == null) {
Console.WriteLine("List is empty");
}
else {
do{
//Index will point to node next to current
index = current.next;
while(index != head) {
//If current node is greater than index data, swaps the data
if(current.data.CompareTo(index.data) > 0) {
temp = current.data;
current.data= index.data;
index.data = temp;
}
index= index.next;
}
current =current.next;
}while(current.next != head); 
}
}
//Displays all the nodes in the list
public void display(){
Node<T> 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<int> cl = new CreateList<int>();
//Adds data to the list
cl.add(70);
cl.add(90);
cl.add(20);
cl.add(100);
cl.add(50);
//Displaying original list
Console.WriteLine("Original list: ");
cl.display();
//Sorting list
cl.sortList();
//Displaying sorted list
Console.WriteLine("Sorted list: ");
cl.display();
} 
}
}

输出

Original list: 
 70 90 20 100 50
Sorted list: 
 20 50 70 90 100

PHP

<!DOCTYPE html>
<html>
<body>
<?php
//Represents the node of list.
class Node{
    public $data;
    public $next;
    function __construct($data){
        $this->data = $data;
        $this->next = NULL;
    }
}
class CreateList{
    //Declaring head and tail pointer as null.
    private $head;
    private $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;
        }
    }
    
    //This function sorts the list in ascending order
function sortList() {
//Current will point to head
$current = $this->head;
if($this->head == NULL) {
echo "List is empty";
}
else {
do{
//Index will point to node next to current
$index = $current->next;
while($index != $this->head) {
//If current node is greater than index data, swaps the data
if($current->data > $index->data) {
$temp = $current->data;
$current->data= $index->data;
$index->data = $temp;
}
$index= $index->next;
}
$current = $current->next;
}while($current->next != $this->head); 
}
}
    
    //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 "<br>";
        }
    }   
}
$cl = new CreateList();
//Adds data to the list
$cl->add(70);
$cl->add(90);
$cl->add(20);
$cl->add(100);
$cl->add(50);

//Displaying original list
echo "Original list:<br>";
$cl->display();

//Sorting list
$cl->sortList();

//Displaying sorted list
echo "Sorted list:<br>";
$cl->display();
?>
</body>
</html>

输出

Original list: 
 70 90 20 100 50
Sorted list: 
 20 50 70 90 100

下一主题#

问。排序循环链表元素的程序。

说明

算法

解决方案

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

相关帖子

编写查找六棱柱（Hexagonal Prism）面积的程序

打印数字图案 18 的程序

编写查找长方体（Rectangular Prism）面积的程序

将给定二叉树转换为双向链表的程序

将天数转换为年的程序

将英尺转换为厘米的程序

右旋数组元素的程序

将温度从摄氏度转换为开尔文的程序

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

查找具有 N 个键的二叉搜索树的总可能数量的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器