方法java.util.Stack.search()用于查找元素是否在堆栈中或Java中。该方法采用单个参数,即在堆栈中搜索的元素。如果可用,它返回元素在堆栈中的位置(从1开始计数),如果元素在堆栈中不可用,则返回-1。
演示此的程序如下所示-
import java.util.Stack; public class Demo { public static void main (String args[]) { Stack stack = new Stack(); stack.push("Apple"); stack.push("Mango"); stack.push("Pear"); stack.push("Orange"); stack.push("Guava"); System.out.println("The stack elements are: " + stack); System.out.println("The element Mango is in the stack at position: " + stack.search("Mango")); System.out.println("The element Peach is in the stack at position: " + stack.search("Peach")); } }
输出结果
The stack elements are: [Apple, Mango, Pear, Orange, Guava] The element Mango is in the stack at position: 4 The element Peach is in the stack at position: -1
现在让我们了解上面的程序。
已创建堆栈。然后使用Stack.push()方法将元素添加到堆栈中。将显示堆栈,然后使用Stack.search()方法查找元素“ Mango”和“ Peach”是否在堆栈中。演示这的代码片段如下-
Stack stack = new Stack(); stack.push("Apple"); stack.push("Mango"); stack.push("Pear"); stack.push("Orange"); stack.push("Guava"); System.out.println("The stack elements are: " + stack); System.out.println("The element Mango is in the stack at position: " + stack.search("Mango")); System.out.println("The element Peach is in the stack at position: " + stack.search("Peach"));