剑指Offer: (Java实现) 栈的压入、弹出序列

import java.util.Stack;

/**
* @author 作者 : shanzhi
* @version 创建时间：2017-5-28 下午12:19:33
* 贡献点在于用Java来实现
*/
public class JZ22_StackInputOuput {
public static int sL = 0;
public static int oL = 0;
public static void main(String[] args) {
int[] source = {1,2,3,4,5};
int[] out1 = {4,5,3,2,1};
int[] out2 = {4,3,5,1,2};
sL = source.length;
oL = out1.length;
System.out.println(match(source,out1));
}
public static boolean match(int[] source,int[] out){
int i = 0;
Stack<Integer> sta = new Stack<Integer>();
int index1 = 0;  //对应source的下标,用于获取具体值
int index2 = 0;  //对应out的下标,用于获取具体值
while( index2 < oL){
int r1 = findIndex(source,out[index2]);
if( r1 == sL){
break;
}else if( r1 >= index1 ){
for ( i = index1;i <= r1;i++){
sta.push(source[i]);
}
index1 = i;
sta.pop();
index2++;
}else if( r1 < index1 ){
if( sta.peek() != out[index2]){
break;
} else {
sta.pop();
index2++;
}
}
}
if( index2 == oL ){
return true;
}
return false;
}
/**
* 如果返回的是source数组的长度说明没找到。
*/
public static int findIndex(int[] source, int num){
int i = 0;
for( ; i< sL; i++){
if( source[i] == num){
break;
}
}
return i;
}
}