包含min函数的栈

题目描述

定义栈的数据结构，请在该类型中实现一个能够得到栈最小元素的min函数。

import java.util.Stack;

public class Solution {
	Stack<Integer> data = new Stack<>();
	Stack<Integer> min = new Stack<>();
    Integer temp =null;
    public void push(int node) {
        if(temp != null) {
            if(node <= temp) {
                temp = node;
                min.push(node);
            } 
            data.push(node);
        } else {
                temp = node;
                min.push(node);
                data.push(node);
        }
    }
    
    public void pop() {
		int num = data.pop();
        int num2 = min.pop();
        if(num != num2) {
            min.push(num2);
        }
    }
    
    public int top() {
        int num = data.pop();
        data.push(num);
        return num;
    }
    
    public int min() {
        int num = min.pop();
        min.push(num);
        return num;
    }
}