public class StackIsValide31 {
public static void main(String[] args) {
int[] in = {1, 2, 3, 4, 5};
int[] out = {4, 5, 3, 1, 1};
System.out.println(isValide(in, out));
}
private static boolean isValide(int[] in, int[] out) {
if (in.length != out.length)
return false;
int length = in.length;
Stack<Integer> stack = new Stack<>();
int i = 0, j = 0;
for (; i < length; i++) {
stack.push(in[i]);
while (j < length && !stack.isEmpty() && stack.peek() == out[j]) {
j++;
stack.pop();
}
}
return stack.isEmpty();
}
}
剑指offer31 验证一个出栈顺序是否正确 Java
猜你喜欢
转载自blog.csdn.net/weixin_43065507/article/details/99335803
今日推荐
周排行