剑指offer面试题 22 栈的压入、弹出序列的匹配

不多说,上代码

package sword.to.offer;

import java.util.Stack;

public class IsPopOrder {

	static boolean isPopOrder(final int[]pPush,final int[] pPop,int nLegnth){
		boolean bImpossible=false;
		
		if(pPush.length!=0&&pPop.length!=0){
			java.util.Stack stack=new Stack();
			int i=0;
			int j=0;
			while(j
运行结果:



你可能感兴趣的:(java)