📌  相关文章
📜  数据结构示例-搜索双向链接列表中的元素

📅  最后修改于: 2020-10-15 05:32:33             🧑  作者: Mango

问：在双向链表中搜索元素的程序

说明

在此程序中，我们需要在双向链表中搜索给定的节点。

为了解决这个问题，我们将使用节点电流遍历列表。当前指向头部并开始将搜索到的节点数据与当前节点数据进行比较。如果它们相等，则将标志设置为true并print消息以及搜索到的节点的位置。

对于例如在上面的列表中，搜索节点说可以在位置3找到4。

算法

  • 定义一个Node类，该类代表列表中的一个节点。它具有三个属性：数据，前一个将指向上一个节点，下一个将指向下一个节点。
  • 定义另一个用于创建双向链接列表的类，它具有两个节点：head和tail。最初，头和尾将指向null。
  • addNode()将节点添加到列表中：
    1. 它首先检查head是否为空，然后将节点插入为head。
    2. 头部和尾部都将指向新添加的节点。
    3. 头的前一个指针将指向空，而头的下一个指针将指向空。
    4. 如果head不为null，则新节点将插入列表的末尾，以使新节点的前一个指针指向尾。
    5. 新的节点将成为新的尾巴。尾巴的下一个指针将指向null。
  • searchNode()将在列表中搜索一个节点：
    1. 变量i将跟踪搜索到的节点的位置。
    2. 变量标志将存储布尔值false。
    3. 电流将指向头节点。
    4. 通过将电流增加到current.next并将i增加到i + 1来遍历循环。
    5. 将每个节点的数据与搜索到的节点进行比较。如果找到匹配项，请将标志设置为true。
    6. 如果该标志为true，则打印搜索到的节点的位置。
    7. 否则，print消息“列表中不存在元素”。

示例：

Python

#Represent a node of doubly linked list
class Node:
    def __init__(self,data):
        self.data = data;
        self.previous = None;
        self.next = None;
        
class SearchList:
    #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;
            
    #searchNode() will search a given node in the list
    def searchNode(self, value):
        i = 1;
        flag = False;
        #Node current will point to head
        current = self.head;
        
        #Checks whether the list is empty
        if(self.head == None):
            print("List is empty");
            return;
            
        while(current != None):
            #Compare value to be searched with each node in the list
            if(current.data == value):
                flag = True;
                break;
            current = current.next;
            i = i + 1;
            
        if(flag):
            print("Node is present in the list at the position : " + str(i));
        else:
            print("Node is not present in the list");
        
dList = SearchList();
#Add nodes to the list
dList.addNode(1);
dList.addNode(5);
dList.addNode(4);
dList.addNode(2);
dList.addNode(3);
 
#Search for node 4 in the list
dList.searchNode(4);
 
#Search for node 9 in the list
dList.searchNode(9);

输出：

Node is present in the list at the position : 3
Node is not present in the list

C

#include 
#include 
 
//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;
    }
}
 
//searchNode() will search a given node in the list
void searchNode(int value) {
    int i = 1;
    bool flag = false;
    //Node current will point to head
    struct node *current = head;
    
    //Checks whether the list is empty
    if(head == NULL) {
        printf("List is empty\n");
        return;
    }
    while(current != NULL) {
        //Compare value to be searched with each node in the list
        if(current->data == value) {
            flag = true;
            break;
        }
        current = current->next;
        i++;
    }
    if(flag)
         printf("Node is present in the list at the position : %d\n", i);
    else
         printf("Node is not present in the list\n");
}
 
int main()
{
    //Add nodes to the list
    addNode(1);
    addNode(5);
    addNode(4);
    addNode(2);
    addNode(3);
    
    //Search for node 4 in the list
    searchNode(4);
    //Search for node 9 in the list
    searchNode(9);
 
    return 0;
}

输出：

Node is present in the list at the position : 3
Node is not present in the list

JAVA

public class SearchList {
    
    //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;
        }
    }
    
    //searchNode() will search a given node in the list
    public void searchNode(int value) {
        int i = 1;
        boolean flag = false;
        //Node current will point to head
        Node current = head;
        
        //Checks whether the list is empty
        if(head == null) {
            System.out.println("List is empty");
            return;
        }
        while(current != null) {
            //Compare value to be searched with each node in the list
            if(current.data == value) {
                flag = true;
                break;
            }
            current = current.next;
            i++;
        }
        if(flag)
             System.out.println("Node is present in the list at the position : " + i);
        else
             System.out.println("Node is not present in the list");
    }
    
    public static void main(String[] args) {
        
        SearchList dList = new SearchList();
        //Add nodes to the list
        dList.addNode(1);
        dList.addNode(5);
        dList.addNode(4);
        dList.addNode(2);
        dList.addNode(3);
        
        //Search for node 4 in the list
        dList.searchNode(4);
        //Search for node 9 in the list
        dList.searchNode(9);
    }
}

输出：

Node is present in the list at the position : 3
Node is not present in the list

C＃

using System; 
namespace DoublyLinkedList 
{                     
    public class Program
    {
        //Represent a node of the doubly linked list

        public class Node{
            public T data;
            public Node previous;
            public Node next;
            
            public Node(T value) {
                data = value;
            }
        }
        
        public class SearchList{
            //Represent the head and tail of the doubly linked list
            protected Node head = null;             
             protected Node tail = null;
            
            //addNode() will add a node to the list
            public void addNode(T 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;
                }
            }
            
            //searchNode() will search a given node in the list
            public void searchNode(int value) {
                int i = 1;
                bool flag = false;
                //Node current will point to head
                Node current = head;
 
                //Checks whether the list is empty
                if(head == null) {
                    Console.WriteLine("List is empty");
                    return;
                }
                while(current != null) {
                    //Compare value to be searched with each node in the list
                    if(current.data.Equals(value)) {
                        flag = true;
                        break;
                    }
                    current = current.next;
                    i++;
                }
                if(flag)
                    Console.WriteLine("Node is present in the list at the position : " + i);
                else
                    Console.WriteLine("Node is not present in the list");
            }
        }
        
        public static void Main()
        {
            SearchList dList = new SearchList();
            //Add nodes to the list
            dList.addNode(1);
            dList.addNode(5);
            dList.addNode(4);
            dList.addNode(2);
            dList.addNode(3);
 
            //Search for node 4 in the list
            dList.searchNode(4);
            //Search for node 9 in the list
            dList.searchNode(9);
        }    
    }
}

输出：

Node is present in the list at the position : 3
Node is not present in the list

PHP：




data = $data;
    }
}
class SearchList{
    //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;
        }
    }
    
    //searchNode() will search a given node in the list
    function searchNode($value) {
        $i = 1;
        $flag = false;
        //Node current will point to head
        $current = $this->head;
        
        //Checks whether the list is empty
        if($this->head == NULL) {
            print("List is empty");
            return;
        }
        while($current != NULL) {
            //Compare value to be searched with each node in the list
            if($current->data == $value) {
                $flag = true;
                break;
            }
            $current = $current->next;
            $i++;
        }
        if($flag)
             print("Node is present in the list at the position : " . $i);
        else
             print("Node is not present in the list");
    }
}
    
$dList = new SearchList();
//Add nodes to the list
$dList->addNode(1);
$dList->addNode(5);
$dList->addNode(4);
$dList->addNode(2);
$dList->addNode(3);
 
//Search for node 4 in the list
$dList->searchNode(4);
print("
");
//Search for node 9 in the list
$dList->searchNode(9);
?>

输出：

Node is present in the list at the position : 3
Node is not present in the list