1. 压栈(push):将一个元素添加到栈顶。
```java
import java.util.Stack;
public class StackExample {
public static void main(String[] args) {
Stack
stack.push(1);
stack.push(2);
stack.push(3);
}
}
```
2. 弹栈(pop):将栈顶的元素移除并返回。
```java
import java.util.Stack;
public class StackExample {
public static void main(String[] args) {
Stack
stack.push(1);
stack.push(2);
stack.push(3);
int topElement = stack.pop(); // 弹出栈顶元素,结果为3
System.out.println("Top element after pop: " + topElement); // 输出:Top element after pop: 3
}
}
```
3. peek():查看栈顶元素,但不移除它。如果栈为空,则抛出异常。
```java
import java.util.Stack;
public class StackExample {
public static void main(String[] args) {
Stack
stack.push(1);
stack.push(2);
stack.push(3);
int topElement = stack.peek(); // 查看栈顶元素,结果为3
System.out.println("Top element after peek: " + topElement); // 输出:Top element after peek: 3
}
}
```
以上关于java stack peek pop-PEEK百家百科内容为上海春毅新材料原创,请勿转载!