不得已一维护一个栈并维护栈的最小元素getMin

2019-11-14 10:58:10

字体：大中小

来源：转载

供稿：网友

github：https://github.com/cbamls 欢迎加入 (java)全国各校IT精英 QQ群号： 467123855

package com.offer.chapter1;import java.util.Stack;/** * CopyRright (c)2014-2016 Haerbin Hearglobal Co.,Ltd * PRoject: demo * Comments: * Author:cbam * Create Date:2017/2/4 * Modified By: * Modified Date: * Modified Reason: */public class Problem_01_MyStack1 { private Stack<Integer> stackData; private Stack<Integer> stackMin; public Problem_01_MyStack1() { this.stackData = new Stack<>(); this.stackMin = new Stack<>(); } public int getMin() { if(this.stackMin.isEmpty()) { throw new RuntimeException("Your stack is empty"); } return this.stackMin.peek(); } 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; }}

上一篇：HDOJ.1010 Tempter of the Bone (DFS)

下一篇：G++和C++的区别（oj中）