从单链表中查找最大值和最小值节点的程序

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

说明

在此程序中，我们需要找出给定单链表中的最小值和最大值节点。

Program to find the maximum and minimum value node from a singly linked list

我们将维护两个变量 min 和 max。Min 将保存最小值节点，max 将保存最大值节点。在上面的例子中，1将是最小值节点，8将是最大值节点。查找最大和最小节点的算法如下。

算法

创建一个名为 Node 的类，它有两个属性：data 和 next。Next 是指向链表中下一个节点的指针。
创建另一个类 MinMax，它有两个属性：head 和 tail。
addNode() 将向列表添加一个新节点
1. 创建一个新节点。
2. 它首先检查 head 是否等于 null，这意味着列表为空。
3. 如果列表为空，则 head 和 tail 都将指向新添加的节点。
4. 如果列表不为空，新节点将添加到列表末尾，使得 tail 的 next 指向新添加的节点。此新节点将成为列表的新 tail。
minNode() 将显示最小值节点
1. 定义一个变量 min 并将其初始化为 head 的数据。
2. Node current 将指向 head。
3. 通过将每个节点的数据与 min 进行比较来遍历列表。
4. 如果 min 大于 current 的数据，则 min 将保存 current 的数据。
5. 在列表的末尾，变量 min 将保存最小值节点。
6. 显示 min 值。
maxNode() 将显示最大值节点
1. 定义一个变量 max 并将其初始化为 head 的数据。
2. Node current 将指向 head。
3. 通过将每个节点的数据与 max 进行比较来遍历列表。
4. 如果 max 小于 current 的数据，则 max 将保存 current 的数据。
5. 在列表的末尾，变量 max 将保存最大值节点。
6. 显示 max 值。

解决方案

Python

#Represent a node of the singly linked list
class Node:
    def __init__(self,data):
        self.data = data;
        self.next = None;
        
class MinMax:
    #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;
            
    #minNode() will find out the minimum value node in the list
    def minNode(self):
        current = self.head;
        
        if(self.head == None):
            print("List is empty");
        else:
            #Initializing min with head node data
            min = self.head.data;
            
            while(current != None):
                #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;
            print("Minimum value node in the list: " + str(min));
            
    #maxNode() will find out the maximum value node in the List
    def maxNode(self):
        current = self.head;
        
        if(self.head == None):
            print("List is empty");
        else:
            #Initializing max with head node data
            max = self.head.data;
            
            while(current != None):
                #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;
            print("Maximum value node in the list: " + str(max));
 
sList = MinMax();    
        
#Adds data to the list
sList.addNode(5);
sList.addNode(8);
sList.addNode(1);
sList.addNode(6);
 
#Display the minimum value node in the list
sList.minNode();
 
#Display the maximum value node in the list
sList.maxNode();

输出

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

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;
    }
}
 
//minNode() will find out the minimum value node in the list
void minNode() {
    struct node *current = head;
    int min;
    
    if(head == NULL) {
        printf("List is empty \n");
    }
    else {
        //Initializing min with head node data
        min = head->data;
        
        while(current != NULL){
             //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;
        }        
        printf("Minimum value node in the list: %d\n", min);
    }
}
    
//maxNode() will find out the maximum value node in the list
void maxNode() {
    struct node *current = head;
    int max;
    
    if(head == NULL) {
        printf("List is empty \n");
    }
    else {
        //Initializing max with head node data
        max = head->data;
        
        while(current != NULL){
             //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;
        }             
        printf("Maximum value node in the list: %d\n", max);
    }
}
    
int main()
{
    //Adds data to the list
    addNode(5);
    addNode(8);
    addNode(1);
    addNode(6);
 
    //Display the minimum value node in the list
    minNode();
    
    //Display the maximum value node in the list
    maxNode();
        
    return 0;
}

输出

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

JAVA

public class MinMax {
    
    //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;
        }
    }
    
    //minNode() will find out the minimum value node in the list
    public void minNode() {
        Node current = head;
        int min;
        
        if(head == null) {
            System.out.println("List is empty");
        }
        else {
            //Initializing min with head node data
            min = head.data;
            
            while(current != null){
                 //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;
            }        
            System.out.println("Minimum value node in the list: "+ min);
        }
    }
        
    //maxNode() will find out the maximum value node in the list
    public void maxNode() {
        Node current = head;
        int max;
        
        if(head == null) {
            System.out.println("List is empty");
        }
        else {
            //Initializing max with head node data
            max = head.data;
            
            while(current != null){
                 //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;
            }             
            System.out.println("Maximum value node in the list: "+ max);
        }
    }
    
    public static void main(String[] args) {
        
        MinMax sList = new MinMax();    
        
        //Adds data to the list
        sList.addNode(5);
        sList.addNode(8);
        sList.addNode(1);
        sList.addNode(6);
 
        //Display the minimum value node in the list
        sList.minNode();
        
        //Display the maximum value node in the list
        sList.maxNode();
    }
}

输出

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

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 MinMax<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;
            }
        }
    
        //minNode() will find out the minimum value node in the list
        public void minNode() {
            Node<T> current = head;
            T min;
 
            if(head == null) {
                Console.WriteLine("List is empty");
            }
            else {
                //Initializing min with head node data
                min = head.data;
 
                while(current != null){
                     //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;
                }        
                Console.WriteLine("Minimum value node in the list: "+ min);
            }
        }
        
        //maxNode() will find out the maximum value node in the list
        public void maxNode() {
            Node<T> current = head;
            T max;
 
            if(head == null) {
                Console.WriteLine("List is empty");
            }
            else {
                //Initializing max with head node data
                max = head.data;
 
                while(current != null){
                     //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;
                }             
                Console.WriteLine("Maximum value node in the list: "+ max);
            }
        }
    }
    
    public static void Main()
    {
        MinMax<int> sList = new MinMax<int>();    
        
        //Adds data to the list
        sList.addNode(5);
        sList.addNode(8);
        sList.addNode(1);
        sList.addNode(6);
 
        //Display the minimum value node in the list
        sList.minNode();
        
        //Display the maximum value node in the list
        sList.maxNode();
    }
}

输出

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

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 MinMax{
    //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;
        }
    }
    
    //minNode() will find out the minimum value node in the list
    function minNode() {
        $current = $this->head;
        
        if($this->head == null) {
            print("List is empty <br>");
        }
        else {
            //Initializing min with head node data
            $min = $this->head->data;
            
            while($current != null){
                 //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;
            }        
            print("Minimum value node in the list: ". $min);
        }
    }
        
    //maxNode() will find out the maximum value node in the list
    function maxNode() {
        $current = $this->head;
        
        if($this->head == null) {
            print("List is empty <br>");
        }
        else {
            //Initializing max with head node data
            $max = $this->head->data;
            
            while($current != null){
                 //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;
            }             
            print("<br>Maximum value node in the list: ". $max);
        }
    }
}
    
$sList = new MinMax();    
        
//Adds data to the list
$sList->addNode(5);
$sList->addNode(8);
$sList->addNode(1);
$sList->addNode(6);
 
//Display the minimum value node in the list
$sList->minNode();
 
//Display the maximum value node in the list
$sList->maxNode();
?>
</body>
</html>

输出

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

下一主题#

从单链表中查找最大值和最小值节点的程序

说明

算法

解决方案

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

相关帖子

打印数字图案 12 的程序

从双向链表开头删除新节点的程序

打印给定字符串中最小和最大可能回文单词的程序

计算字符串中字符总数的程序

检查哈沙德数（Harshad number）的程序

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

编写计算菱形周长的程序

检查快乐数（Happy number）的程序

从三元树创建双向链表的程序

编写计算等腰三角形面积的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器