题目:输入两个整数序列,第一个序列表示栈的压入顺序,判断第二个序列是否在该栈的弹出序列,假设压入栈的所有数字均不相等
思路:用一个辅助栈即可
mport java.util.Stack;
public class IsPopOrder {
public static void main(String[] args) {
int[] a= {1,2,3,4,5};
int[] b ={4,5,3,2,1};
int[] c= {4,3,5,1,2};
System.out.println(isPopOrder(a, b));
System.out.println(isPopOrder(a, c));
}
public static boolean isPopOrder(int[] input,int[] output){
if(input==null || output==null || input.length==0 || output.length==0)
return false;
Stack
stack= new Stack<>();
int i = 0;
int j = 0;
for(;i