Java Stack search()方法

Java中的java.util.Stack.search( Object element )方法用于在堆栈中搜索一个元素，并获得它与顶部的距离。这个方法从1开始计数，而不是从0开始计数。在堆栈顶部的元素被认为是在位置1。如果有一个以上的元素，则返回最接近顶部的元素的索引。如果成功找到该元素，该方法返回其位置，如果该元素不存在，则返回-1。

语法

STACK.search(element)

参数： 该方法接受一个参数元素，指的是需要在堆栈中搜索的元素。

返回值： 如果在堆栈中成功找到该元素，该方法将返回该元素的位置（以计数为基数1），否则将返回-1。

下面的程序说明了java.util.Stack.search()方法的工作：

程序1 :

// Java code to demonstrate search() method
import java.util.*;
  
public class Stack_Demo {
    public static void main(String[] args)
    {
  
        // Creating an empty Stack
        Stack<String> STACK = new Stack<String>();
  
        // Stacking strings
        STACK.push("Geeks");
        STACK.push("4");
        STACK.push("Geeks");
        STACK.push("Welcomes");
        STACK.push("You");
  
        // Displaying the Stack
        System.out.println("The stack is: " + STACK);
  
        // Checking for the element "4"
        System.out.println("Does the stack contains '4'? "
                                     + STACK.search("4"));
        // Checking for the element "Hello"
        System.out.println("Does the stack contains 'Hello'? "
                                     + STACK.search("Hello"));
  
        // Checking for the element "Geeks"
        System.out.println("Does the stack contains 'Geeks'? "
                                     + STACK.search("Geeks"));
    }
}

输出：

The stack is: [Geeks, 4, Geeks, Welcomes, You]
Does the stack contains '4'? 4
Does the stack contains 'Hello'? -1
Does the stack contains 'Geeks'? 3

示例2

// Java code to demonstrate search() method
import java.util.*;
  
public class Stack_Demo {
    public static void main(String[] args)
    {
  
        // Creating an empty Stack
        Stack<Integer> STACK = new Stack<Integer>();
  
        // Stacking int values
        STACK.push(8);
        STACK.push(5);
        STACK.push(9);
        STACK.push(2);
        STACK.push(4);
  
        // Displaying the Stack
        System.out.println("The stack is: " + STACK);
  
        // Checking for the element 9
        System.out.println("Does the stack contains '9'? "
                                       + STACK.search(9));
        // Checking for the element 10
        System.out.println("Does the stack contains '10'? "
                                       + STACK.search(10));
  
        // Checking for the element 11
        System.out.println("Does the stack contains '11'? "
                                       + STACK.search(11));
    }
}

输出：

The stack is: [8, 5, 9, 2, 4]
Does the stack contains '9'? 3
Does the stack contains '10'? -1
Does the stack contains '11'? -1