查找循环链表中的最大值和最小值节点程序

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

说明

在这个程序中，我们将创建一个循环链表，然后遍历该列表以找出最小和最大的节点。

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

我们将维护两个变量 min 和 max。Min 将保存最小值节点，max 将保存最大值节点。在上面的示例中，2 将是最小值节点，9 将是最大值节点。

算法

定义一个 Node 类，它表示列表中的一个节点。它有两个属性 data 和 next，next 将指向下一个节点。
定义另一个类来创建循环链表，它有两个节点：head 和 tail。
minNode() 将打印出最小值节点
1. 定义变量 min 并使用 head 的数据初始化它。
2. 当前节点将指向 head。
3. 通过将每个节点的数据与 min 进行比较来遍历列表。
4. 如果 min > 当前节点的数据，则 min 将保存当前节点的数据。
5. 在列表的末尾，变量 min 将保存最小值节点。
6. 打印最小值。
maxNode() 将打印出最大值节点
1. 定义变量 max 并使用 head 的数据初始化它。
2. 当前节点将指向 head。
3. 通过将每个节点的数据与 max 进行比较来遍历列表。
4. 如果 max > current 的数据，则 max 将保存 current 的数据。
5. 在列表的末尾，变量 max 将保存最大值节点。
6. 打印最大值。

解决方案

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;
            
    #Finds out the minimum value node in the list
    def minNode(self):
        current = self.head;
        #Initializing min to initial node data
        minimum = self.head.data;
        if(self.head == None):
            print("List is empty");
        else:
            while(True):
                #If current node's data is smaller than min
                #Then replace value of min with current node's data
                if(minimum > current.data):
                    minimum = current.data;
                current= current.next;
                if(current == self.head):
                    break;
        print("Minimum value node in the list: "+ str(minimum));
 
    #Finds out the maximum value node in the list
    def maxNode(self):
        current = self.head;
        #Initializing max to initial node data
        maximum = self.head.data;
        if(self.head == None):
            print("List is empty");
        else:
            while(True):
                #If current node's data is greater than max
                #Then replace value of max with current node's data
                if(maximum < current.data):
                    maximum = current.data;
                current= current.next;
                if(current == self.head):
                    break;
        print("Maximum value node in the list: "+ str(maximum));
 
class CircularLinkedList:
    cl = CreateList();
    #Adds data to the list
    cl.add(5);
    cl.add(20);
    cl.add(10);
    cl.add(1);
    #Prints the minimum value node in the list
    cl.minNode();
    #Prints the maximum value node in the list
    cl.maxNode();

输出

Minimum value node in the list: 1
Maximum value node in the list: 20

C

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
 
//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;
    }
}
 
//Finds out the minimum value node in the list
void minNode() {
    struct node *current = head;
    //Initializing min to initial node data
    int min = head->data;
    if(head == NULL) {
        printf("\nList is empty");
    }
    else {
         do{
             //If current node's data is smaller than min
             //Then replace value of min with current node's data
             if(min > current->data) {
                 min = current->data;
             }
             current= current->next;
        }while(current != head);
        
        printf("Minimum value node in the list: %d", min);
    }
}
        
//Finds out the maximum value node in the list
void maxNode() {
    struct node *current = head;
    //Initializing max to initial node data
    int max = head->data;
    if(head == NULL) {
        printf("\nList is empty");
    }
    else {
         do{
             //If current node's data is greater than max
             //Then replace value of max with current node's data
             if(max < current->data) {
                 max = current->data;
             }
             current= current->next;
            }while(current != head);
         
        printf("\nMaximum value node in the list: %d", max);
    }
}
    
int main()
{
    //Adds data to the list
    add(5);
    add(20);
    add(10);
    add(1);
    //Prints the minimum value node in the list
    minNode();
    //Prints the maximum value node in the list
    maxNode();
   
   return 0;
}

输出

Minimum value node in the list: 1
Maximum value node in the list: 20

JAVA

public class MinMax {
    //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;
        }
    }
    
    //Finds out the minimum value node in the list
    public void minNode() {
        Node current = head;
        //Initializing min to initial node data
        int min = head.data;
        if(head == null) {
            System.out.println("List is empty");
        }
        else {
             do{
                 //If current node's data is smaller than min
                 //Then replace value of min with current node's data
                 if(min > current.data) {
                     min = current.data;
                 }
                 current= current.next;
            }while(current != head);
        
            System.out.println("Minimum value node in the list: "+ min);
        }
    }
        
    //Finds out the maximum value node in the list
    public void maxNode() {
        Node current = head;
        //Initializing max to initial node data
        int max = head.data;
        if(head == null) {
            System.out.println("List is empty");
        }
        else {
             do{
                 //If current node's data is greater than max
                 //Then replace value of max with current node's data
                 if(max < current.data) {
                     max = current.data;
                 }
                 current= current.next;
                }while(current != head);
             
            System.out.println("Maximum value node in the list: "+ max);
        }
    }
                
    public static void main(String[] args) {
        MinMax cl = new MinMax();
        //Adds data to the list
        cl.add(5);
        cl.add(20);
        cl.add(10);
        cl.add(1);
        //Prints the minimum value node in the list
        cl.minNode();
        //Prints the maximum value node in the list
        cl.maxNode();
    }
}

输出

Minimum value node in the list: 1
Maximum value node in the list: 20

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;
                }
            }
            
            
            //Finds out the minimum value node in the list
            public void minNode() {
                Node<T> current = head;
                //Initializing min to initial node data
                T min = head.data;
                if(head == null) {
                    Console.WriteLine("List is empty");
                }
                else {
                     do{
                         //If current node's data is smaller than min
                         //Then replace value of min with current node's data
                         if(min.CompareTo(current.data) > 0) {
                             min = current.data;
                         }
                         current= current.next;
                    }while(current != head);
                
                    Console.WriteLine("Minimum value node in the list: "+ min);
                }
            }
            
            //Finds out the maximum value node in the list
            public void maxNode() {
                Node<T> current = head;
                //Initializing max to initial node data
                T max = head.data;
                if(head == null) {
                    Console.WriteLine("List is empty");
                }
                else {
                     do{
                         //If current node's data is greater than max
                         //Then replace value of max with current node's data
                         if(max.CompareTo(current.data) < 0) {
                            
                             max = current.data;
                         }
                         current= current.next;
                        }while(current != head);
                     
                    Console.WriteLine("Maximum value node in the list: "+ max);
                }
            }
        }
        
        public static void Main()
        {
            
        CreateList<int> cl = new CreateList<int>();
        //Adds data to the list
        cl.add(5);
        cl.add(20);
        cl.add(10);
        cl.add(1);
        //Prints the minimum value node in the list
        cl.minNode();
        //Prints the maximum value node in the list
        cl.maxNode();
        }    
    }
}

输出

Minimum value node in the list: 1
Maximum value node in the list: 20

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;
        }
    }
    
    //Finds out the minimum value node in the list
    function minNode() {
        $current = $this->head;
        //Initializing min to initial node data
        $min = $this->head->data;
        if($this->head == NULL) {
            echo "List is empty";
        }
        else {
             do{
                 //If current node's data is smaller than min
                 //Then replace value of min with current node's data
                 if($min > $current->data) {
                     $min = $current->data;
                 }
                 $current= $current->next;
            }while($current != $this->head);
        
            echo "Minimum value node in the list: $min <br>";
        }
    }
        
    //Finds out the maximum value node in the list
    function maxNode() {
        $current = $this->head;
        //Initializing max to initial node data
        $max = $this->head->data;
        if($this->head == NULL) {
            echo "List is empty";
        }
        else {
             do{
                 //If current node's data is greater than max
                 //Then replace value of max with current node's data
                 if($max < $current->data) {
                     $max = $current->data;
                 }
                 $current= $current->next;
                }while($current != $this->head);
             
            echo "Maximum value node in the list: $max <br>";
        }
    }
}
 
$cl = new CreateList();
//Adds data to the list
$cl->add(5);
$cl->add(20);
$cl->add(10);
$cl->add(1);
//Prints the minimum value node in the list
$cl->minNode();
//Prints the maximum value node in the list
$cl->maxNode();
?>
</body>
</html>

输出

Minimum value node in the list: 1
Maximum value node in the list: 20

下一主题#

查找循环链表中的最大值和最小值节点程序

说明

算法

解决方案

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

相关帖子

将英尺转换为米的程序

打印数组中偶数位置元素的程序

以降序对数组元素进行排序的程序

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

计算五边形面积的程序

编写计算半球表面积的程序

不使用第三个变量交换两个数字的程序

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

计算立方体表面积的程序

不使用模运算符打印数字之和的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器