題目描述 定義棧的數(shù)據(jù)結(jié)構(gòu)，請在該類型中實現(xiàn)一個能夠得到棧最小元素的min函數(shù)。
import java.util.Stack;public class Solution { Stack<Integer> stack1 = new Stack<Integer>(); Stack<Integer> stack2 = new Stack<Integer>(); public void push(int node) { if (stack2.empty()){ stack2.push(node); }else { int top1 = stack1.peek(); if (top1 >= node){ stack2.push(node); }else { stack2.push(top1); } } stack1.push(node); } public void pop() { stack2.pop(); stack1.pop(); } public int top() { return stack1.peek(); } public int min() { return stack2.peek(); }}新聞熱點
疑難解答
