Java Stack面试题

Stack<Integer> stack = new Stack<>();
stack.push(1); // 添加元素到栈顶
Integer element = stack.pop(); // 移除并返回栈顶元素

Stack<Integer> stack = new Stack<>();
Deque<Integer> dequeStack = new ArrayDeque<>();

Stack<Integer> stack = new Stack<>();
stack.push(1); // 入栈
Integer topElement = stack.peek(); // 查看栈顶元素
stack.pop(); // 出栈
boolean isEmpty = stack.isEmpty(); // 检查栈是否为空

Stack<Integer> stack = new Stack<>();
boolean isEmpty = stack.isEmpty();

Stack<Integer> stack = new Stack<>();
stack.push(1);
Integer peekElement = stack.peek(); // 返回栈顶元素1，但不移除
Integer popElement = stack.pop(); // 返回并移除栈顶元素1

Stack<Integer> stack = new Stack<>();
// 示例：添加数字到栈中
stack.push(3);
stack.push(5);
stack.push(2);

Stack<Character> stack = new Stack<>();
stack.push('(');
stack.push(')'); // 匹配成功
boolean isMatch = stack.isEmpty(); // 检查栈是否为空

Stack<Character> stack = new Stack<>();
String word = "level";
for (char c : word.toCharArray()) {
    stack.push(c);
}
String reversed = new String(stack.toArray()); // 出栈得到反转字符串
boolean isPalindrome = word.equals(reversed); // 检查是否是回文

Stack<Integer> stack = new Stack<>();
stack.push(1);
stack.push(1); // 允许重复元素

Stack<Integer> stack = new Stack<>();
stack.push(1);
Iterator<Integer> iterator = stack.iterator();
while (iterator.hasNext()) {
    System.out.println(iterator.next());
    iterator.remove(); // 迭代过程中移除元素
}

Deque<Integer> threadSafeStack = new ArrayDeque<>();
threadSafeStack.push(1);
Integer element = threadSafeStack.pop();

// 使用栈实现队列
Stack<Integer> stack1 = new Stack<>();
Stack<Integer> stack2 = new Stack<>();
stack1.push(1); // 入队
stack2.push(stack1.pop()); // 出队到另一个栈
Integer element = stack2.pop(); // 队首元素

Stack<Node> stack = new Stack<>();
stack.push(root); // 从根节点开始
while (!stack.isEmpty()) {
    Node current = stack.pop();
    // 处理当前节点
    for (Node neighbor : current.neighbors()) {
        stack.push(neighbor); // 将邻居节点入栈
    }
}

Stack<String> undoStack = new Stack<>();
undoStack.push("Action 1"); // 执行操作
// 执行撤销
String lastAction = undoStack.pop();