设计一个有getMin功能的栈

题目：实现一个特殊的栈，在实现栈的基础上能够实现返回栈中最小元素的操作。

要求：① pop、push、getMin 操作的时间复杂度都是 O(1)

         ② 设计的栈类型可以使用现成的栈结构

package zcy_1;

import java.util.Stack;

public class Problem_01_GetMinStack {
		public static class MyStack1 {
			private Stack<Integer> stackData;
			private Stack<Integer> stackMin;

			public MyStack1() {
				this.stackData = new Stack<Integer>();
				this.stackMin = new Stack<Integer>();
			}

			public void push(int newNum) {
				if (this.stackMin.isEmpty()) {
					this.stackMin.push(newNum);
				} else if (newNum <= this.getmin()) {
					this.stackMin.push(newNum);
				}
				this.stackData.push(newNum);
			}

			public int pop() {
				if (this.stackData.isEmpty()) {
					throw new RuntimeException("Your stack is empty.");
				}
				int value = this.stackData.pop();
				if (value == this.getmin()) {
					this.stackMin.pop();
				}
				return value;
			}

			public int getmin() {
				if (this.stackMin.isEmpty()) {
					throw new RuntimeException("Your stack is empty.");
				}
				return this.stackMin.peek();
			}
		}
		public static void main(String[] args) {
			MyStack1 stack1 = new MyStack1();
			stack1.push(3);
			System.out.println(stack1.getmin());
			stack1.push(4);
			System.out.println(stack1.getmin());
			stack1.push(1);
			System.out.println(stack1.getmin());
			System.out.println(stack1.pop());
			System.out.println(stack1.getmin());
		}

	}