标签:假设 代码示例 test ++ static integer string int oid
输入两个整数序列,第一个序列表示栈的压入顺序,请判断第二个序列是否可能为该栈的弹出顺序。假设压入栈的所有数字均不相等。例如序列1,2,3,4,5是某栈的压入顺序,序列4,5,3,2,1是该压栈序列对应的一个弹出序列,但4,3,5,1,2就不可能是该压栈序列的弹出序列。(注意:这两个序列的长度是相等的)
import java.util.Stack;
public class Offer22 {
public static void main(String[] args) {
int[] pushSeq = {1, 2, 3, 4, 5};
int[] popSeq = {4, 5, 3, 2 , 1};
Offer22 testObj = new Offer22();
System.out.println(testObj.isPopOrder(pushSeq, popSeq));
}
public boolean isPopOrder(int[] pushSeq, int[] popSeq) {
int size = pushSeq.length;
Stack<Integer> stack = new Stack<>();
for (int pushIndex = 0, popIndex = 0; pushIndex < size; pushIndex++) {
stack.push(pushSeq[pushIndex]);
while (popIndex < size && !stack.isEmpty()
&& stack.peek() == popSeq[popIndex]) {
stack.pop();
popIndex++;
}
}
return stack.isEmpty();
}
}
标签:假设 代码示例 test ++ static integer string int oid
原文地址:https://www.cnblogs.com/ITxiaolei/p/13167017.html