问. 查找双向链表中最大值和最小值节点的程序。

2025年3月17日 | 阅读 10 分钟

说明

在这个程序中，我们将创建一个双向链表，然后遍历列表找出最小值和最大值节点。

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

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

算法

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

解决方案

Python

#Represent a node of doubly linked list
class Node:
    def __init__(self,data):
        self.data = data;
        self.previous = None;
        self.next = None;
        
class MinMax:
    #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;
            
    #MinimumNode() will find out minimum value node in the list
    def minimumNode(self):
        #Node current will point to head
        current = self.head;
        
        #Checks if list is empty
        if(self.head == None):
            print("List is empty");
            return 0;
        else:
            #Initially, min will store the value of head's data
            min = self.head.data;
            while(current != None):
                #If value of min is greater than current's data
                #Then, replace value of min with current node's data
                if(min > current.data):
                    min = current.data;
                current = current.next;
        return min;
        
    #MaximumNode() will find out maximum value node in the list
    def maximumNode(self):
        #Node current will point to head
        current = self.head;
        
        #Checks if list is empty
        if(self.head == None):
            print("List is empty");
            return 0;
        else:
            #Initially, max will store the value of head's data
            max = self.head.data;
            #If value of max is lesser than current's data
            #Then, replace value of max with current node's data
            while(current != None):
                if(current.data > max):
                    max = current.data;
                current = current.next;
        return max;
            
dList = MinMax();
#Add nodes to the list
dList.addNode(5);
dList.addNode(7);
dList.addNode(9);
dList.addNode(1);
dList.addNode(2);
 
#Prints the minimum value node in the list
print("Minimum value node in the list: "+ str(dList.minimumNode()));
#Prints the maximum value node in the list
print("Maximum value node in the list: "+ str(dList.maximumNode()));

输出

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

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;
    }
}
 
//MinimumNode() will find out minimum value node in the list
int minimumNode() {
    //Node current will point to head
    struct node *current = head;
    int min;
    
    //Checks if list is empty
    if(head == NULL) {
        printf("List is empty\n");
        return 0;
    }
    else {
        //Initially, min will store the value of head's data
        min = head->data;
        while(current != NULL) {
            //If value of min is greater than current's data
            //Then, replace value of min with current node's data
            if(min > current->data)
                min = current->data;
            current = current->next;
        }
    }
    return min;
}
 
//MaximumNode() will find out maximum value node in the list
int maximumNode() {
    //Node current will point to head
    struct node *current = head;
    int max;
    
    //Checks if list is empty
    if(head == NULL) {
        printf("List is empty\n");
        return 0;
    }
    else {
        //Initially, max will store the value of head's data
        max = head->data;
        //If value of max is lesser than current's data
        //Then, replace value of max with current node's data
        while(current != NULL) {
            if(current->data > max) 
                max = current->data;
            current = current->next;
        }
    }
    return max;
}
 
int main()
{
    //Add nodes to the list
    addNode(5);
    addNode(7);
    addNode(9);
    addNode(1);
    addNode(2);
    
    //Prints the minimum value node in the list
    printf("Minimum value node in the list: %d\n", minimumNode());
    //Prints the maximum value node in the list
    printf("Maximum value node in the list: %d", maximumNode());
 
    return 0;
}

输出

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

JAVA

public class MinMax {
    
    //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;
        }
    }
    
    //MinimumNode() will find out minimum value node in the list
    public int minimumNode() {
        //Node current will point to head
        Node current = head;
        int min;
        
        //Checks if list is empty
        if(head == null) {
            System.out.println("List is empty");
            return 0;
        }
        else {
            //Initially, min will store the value of head's data
            min = head.data;
            while(current != null) {
                //If the value of min is greater than the current's data

                //Then, replace the value of min with current node's data

                if(min > current.data)
                    min = current.data;
                current = current.next;
            }
        }
        return min;
    }
    
    //MaximumNode() will find out maximum value node in the list
    public int maximumNode() {
        //Node current will point to head
        Node current = head;
        int max;
        
        //Checks if list is empty
        if(head == null) {
            System.out.println("List is empty");
            return 0;
        }
        else {
            //Initially, max will store the value of head's data
            max = head.data;
            //If value of max is lesser than current's data
            //Then, replace value of max with current node's data
            while(current != null) {
                if(current.data > max) 
                    max = current.data;
                current = current.next;
            }
        }
        return max;
    }
    
    public static void main(String[] args) {
        
        MinMax dList = new MinMax();
        //Add nodes to the list
        dList.addNode(5);
        dList.addNode(7);
        dList.addNode(9);
        dList.addNode(1);
        dList.addNode(2);
        
        //Prints the minimum value node in the list
        System.out.println("Minimum value node in the list: "+ dList.minimumNode());
        //Prints the maximum value node in the list
        System.out.println("Maximum value node in the list: "+ dList.maximumNode());
    }
}

输出

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

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 MinMax<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;
                }
            }
            
            //MinimumNode() will find out minimum value node in the list
            public T minimumNode() {
                //Node current will point to head
                Node<T> current = head;
                T min;
 
                //Checks if list is empty
                if(head == null) {
                    Console.WriteLine("List is empty");
                    return default(T);
                }
                else {
                    //Initially, min will store the value of head's data
                    min = head.data;
                    while(current != null) {
                        //If value of min is greater than current's data
                        //Then, replace value of min with current node's data
                        if(min.CompareTo(current.data) > 0)
                            min = current.data;
                        current = current.next;
                    }
                }
                return min;
            }
    
            //MaximumNode() will find out maximum value node in the list
            public T maximumNode() {
                //Node current will point to head
                Node<T> current = head;
                T max;
 
                //Checks if list is empty
                if(head == null) {
                    Console.WriteLine("List is empty");
                    return default(T);
                }
                else {
                    //Initially, max will store the value of head's data
                    max = head.data;
                    //If value of max is lesser than current's data
                    //Then, replace value of max with current node's data
                    while(current != null) {
                        if(current.data.CompareTo(max) > 0) 
                            max = current.data;
                        current = current.next;
                    }
                }
                return max;
            }
        }
        
        public static void Main()
        {
            MinMax<int> dList = new MinMax<int>();
            //Add nodes to the list
            dList.addNode(5);
            dList.addNode(7);
            dList.addNode(9);
            dList.addNode(1);
            dList.addNode(2);
 
            //Prints the minimum value node in the list
            Console.WriteLine("Minimum value node in the list: "+ dList.minimumNode());
            //Prints the maximum value node in the list
            Console.WriteLine("Maximum value node in the list: "+ dList.maximumNode());
        }    
    }
}           

输出

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

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 MinMax{
    //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;
        }
    }
    
    //MinimumNode() will find out minimum value node in the list
    function minimumNode() {
        //Node current will point to head
        $current = $this->head;
        
        //Checks if list is empty
        if($this->head == NULL) {
            print("List is empty <br>");
            return 0;
        }
        else {
            //Initially, min will store the value of head's data
            $min = $this->head->data;
            while($current != NULL) {
                //If value of min is greater than current's data
                //Then, replace value of min with current node's data
                if($min > $current->data)
                    $min = $current->data;
                $current = $current->next;
            }
        }
        return $min;
    }
    
    //MaximumNode() will find out maximum value node in the list
    function maximumNode() {
        //Node current will point to head
        $current = $this->head;
        
        //Checks if list is empty
        if($this->head == NULL) {
            print("List is empty <br>");
            return 0;
        }
        else {
            //Initially, max will store the value of head's data
            $max = $this->head->data;
            //If value of max is lesser than current's data
            //Then, replace value of max with current node's data
            while($current != NULL) {
                if($current->data > $max) 
                    $max = $current->data;
                $current = $current->next;
            }
        }
        return $max;
    }
}
    
$dList = new MinMax();
//Add nodes to the list
$dList->addNode(5);
$dList->addNode(7);
$dList->addNode(9);
$dList->addNode(1);
$dList->addNode(2);
 
//Prints the minimum value node in the list
print("Minimum value node in the list: " . $dList->minimumNode());
print("<br>");
//Prints the maximum value node in the list
print("Maximum value node in the list: " . $dList->maximumNode());
?>
</body>
</html>

输出

Minimum value node in the list: 1
Maximum value node in the list: 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

相关帖子

摄氏度转华氏度的程序

程序列表 | 编程示例

计算字符串中元音和辅音数量的程序

计算圆锥体积的程序

打印数组中最大元素的程序

计算 CGPA 百分比的程序

对循环链表元素进行排序的程序

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

计算平行四边形面积的程序

确定两个树是否相同的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器