栈的压入、弹出序列java实现

import java.util.ArrayList;
import java.util.Stack;
public class Solution {
public boolean IsPopOrder(int [] pushA,int [] popA) {
if (pushA.length == 0 || popA.length == 0) {
return false;
}
Stack<Integer> stack = new Stack<Integer>();
int j = 0;
for (int i = 0; i < popA.length; i++) {
stack.push(pushA[i]);
while (j < popA.length && stack.peek() == popA[j]) {
stack.pop();
j++;
}
}
return stack.empty() ? true : false;
}
}