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

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

说明

在此程序中，我们创建一个循环链表并在列表中搜索一个节点。

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

考虑上面的例子。假设我们需要搜索节点 5。为了解决这个问题，我们将遍历列表并将每个节点与 5 进行比较。如果找到匹配项，我们将标志设置为 true 并打印节点 5 的位置。在此示例中，节点 5 出现在位置 2。

算法

定义一个 Node 类，它表示列表中的一个节点。它有两个属性 data 和 next，next 将指向下一个节点。
定义另一个类来创建循环链表，它有两个节点：head 和 tail。
search() 函数将搜索列表中的一个节点
1. 变量 i 将跟踪要搜索节点的**位置**。
2. 变量 flag 将存储布尔值 false。
3. Current 将指向 head 节点。
4. 通过将 current 递增到 current.next 并将 i 递增到 i + 1 来迭代循环。
5. 将每个节点的数据与要搜索的节点进行比较。如果找到匹配项，则将 flag 设置为 true。
6. 如果 flag 为 true，则打印搜索节点的 {position}。
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;
            
    #Searches for a node in the list
    def search(self,element):
        current = self.head;
        i = 1;
        flag = False;
        #Checks whether list is empty
        if(self.head == None):
            print("List is empty");
        else:
            while(True): 
                #Compares element to be found with each node present in the list
                if(current.data ==  element):
                    flag = True;
                    break;
                current = current.next;
                i = i + 1;
                if(current == self.head):
                    break;
            if(flag):
                print("Element is present in the list at the position :  " + str(i));
            else:
                print("Element is not present in the list");
 
class CircularLinkedList:
    cl = CreateList();
    #Adds data to the list
    cl.add(1);
    cl.add(2);
    cl.add(3);
    cl.add(4);
    #Search for node 2 in the list
    cl.search(2);
    #Search for node in the list
    cl.search(7);

输出

Element is present in the list at the position : 2
Element is not present in the list

C

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.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;
    }
}
 
//Searches for a node in the list
void search(int element) {
    struct node *current = head;
    int i = 1;
    bool flag = false;
    //Checks whether list is empty
    if(head == NULL) {
        printf("List is empty");
    }
    else {
         do{
             //Compares element to be found with each node present in the list
            if(current->data ==  element) {
                flag = true;
                break;
            }
            current = current->next;
            i++;
        }while(current != head);
         if(flag)
            printf("Element is present in the list at the position : %d", i);
        else
            printf("\nElement is not present in the list");
    }
}
    
int main()
{
    //Adds data to the list
   add(1);
   add(2);
   add(3);
   add(4);
   //Search for node 2 in the list
   search(2);
   //Search for node in the list
   search(7);
   
   return 0;
}

输出

Element is present in the list at the position : 2
Element is not present in the list

JAVA

public class SearchNode {
    //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 point to head.
            tail.next = head;
        }
    }
    
    //Searches for a node in the list
    public void search(int element) {
        Node current = head;
        int i = 1;
        boolean flag = false;
        //Checks whether list is empty
        if(head == null) {
            System.out.println("List is empty");
        }
        else {
             do{
                 //Compares element to be found with each node present in the list
                if(current.data ==  element) {
                    flag = true;
                    break;
                }
                current = current.next;
                i++;
            }while(current != head);
             if(flag)
                 System.out.println("Element is present in the list at the position : " + i);
            else
                 System.out.println("Element is not present in the list");
        }
    }
    
    public static void main(String[] args) {
        SearchNode cl = new SearchNode();
        //Adds data to the list
        cl.add(1);
        cl.add(2);
        cl.add(3);
        cl.add(4);
        //Search for node 2 in the list
        cl.search(2);
        //Search for node in the list
        cl.search(7);
    }
}

输出

Element is present in the list at the position : 2
Element is not present in the list

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>{
            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;
                }
            }
        
            //Searches for a node in the list
            public void search(T element) {
                Node<T> current = head;
                int i = 1;
                bool flag = false;
                //Checks whether list is empty
                if(head == null) {
                    Console.WriteLine("List is empty");
                }
                else {
                     do{
                         //Compares element to be found with each node present in the list
                        if(current.data.Equals(element)) {
                            flag = true;
                            break;
                        }
                        current = current.next;
                        i++;
                    }while(current != head);
                     if(flag)
                         Console.WriteLine("Element is present in the list at the position : " + i);
                    else
                         Console.WriteLine("Element is not present in the list");
                }
            }
        }
        
        public static void Main()
        {
            
        CreateList<int> cl = new CreateList<int>();
        //Adds data to the list
        cl.add(1);
        cl.add(2);
        cl.add(3);
        cl.add(4);
        //Search for node 2 in the list
        cl.search(2);
        //Search for node in the list
        cl.search(7);
        }    
    }
}

输出

Element is present in the list at the position : 2
Element is not present in the list

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;
        }
    }
    
    //Searches for a node in the list
    function search($element) {
        $current = $this->head;
        $i = 1;
        $flag = false;
        //Checks whether list is empty
        if($this->head == NULL) {
            echo "List is empty";
        }
        else {
             do{
                 //Compares element to be found with each node present in the list
                if($current->data == $element) {
                    $flag = true;
                    break;
                }
                $current = $current->next;
                $i++;
            }while($current != $this->head);
             if($flag)
                 echo "Element is present in the list at the position : $i <br>";
            else
                 echo "Element is not present in the list<br>";
        }
    }
}
 
$cl = new CreateList();
//Adds data to the list
$cl->add(1);
$cl->add(2);
$cl->add(3);
$cl->add(4);
//Search for node 2 in the list
$cl->search(2);
//Search for node  in the list
$cl->search(7);
?>
</body>
</html>

输出

Element is present in the list at the position : 2
Element is not present in the list

下一主题#

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

说明

算法

解决方案

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）面积的程序

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

打印 1 到 100 之间的所有普罗尼克数（Pronic number）的程序

打印给定数字的排列 (nPr) 的程序

编写查找商和余数的程序

打印数字图案 4 的程序

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

编写查找五棱柱（Pentagonal Prism）表面积的程序

创建包含 N 个节点的循环链表并计算节点数量的程序

将天数转换为年的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器