Java中的 Stack peek() 方法

Java中的Java .util.Stack.peek() 方法用于检索或获取 Stack 的第一个元素或存在于 Stack 顶部的元素。检索到的元素不会从堆栈中删除或移除。

句法：

STACK.peek()

参数：该方法不带任何参数。

返回值：该方法返回堆栈顶部的元素，如果堆栈为空，则返回 NULL。

异常：如果堆栈为空，该方法将抛出 EmptyStackException 。

下面的程序说明了Java.util.Stack.peek() 方法：
方案一：

// Java code to illustrate peek() function
  
import java.util.*;
  
public class StackDemo {
    public static void main(String args[])
    {
        // Creating an empty Stack
        Stack STACK = new Stack();
  
        // Use push() to add elements into the Stack
        STACK.push("Welcome");
        STACK.push("To");
        STACK.push("Geeks");
        STACK.push("For");
        STACK.push("Geeks");
  
        // Displaying the Stack
        System.out.println("Initial Stack: " + STACK);
  
        // Fetching the element at the head of the Stack
        System.out.println("The element at the top of the"
                           + " stack is: " + STACK.peek());
  
        // Displaying the Stack after the Operation
        System.out.println("Final Stack: " + STACK);
    }
}

输出：

Initial Stack: [Welcome, To, Geeks, For, Geeks]
The element at the top of the stack is: Geeks
Final Stack: [Welcome, To, Geeks, For, Geeks]

方案二：

// Java code to illustrate peek() function
  
import java.util.*;
  
public class StackDemo {
    public static void main(String args[])
    {
        // Creating an empty Stack
        Stack STACK = new Stack();
  
        // Use push() to add elements into the Stack
        STACK.push(10);
        STACK.push(15);
        STACK.push(30);
        STACK.push(20);
        STACK.push(5);
  
        // Displaying the Stack
        System.out.println("Initial Stack: " + STACK);
  
        // Fetching the element at the head of the Stack
        System.out.println("The element at the top of the"
                           + " stack is: " + STACK.peek());
  
        // Displaying the Stack after the Operation
        System.out.println("Final Stack: " + STACK);
    }
}

输出：

Initial Stack: [10, 15, 30, 20, 5]
The element at the top of the stack is: 5
Final Stack: [10, 15, 30, 20, 5]