栈的压入、弹出序列

题目描述：
输入两个整数序列，第一个序列表示栈的压入顺序，请判断第二个序列是否为该栈的弹出顺序。假设压入栈的所有数字均不相等。例如序列1,2,3,4,5是某栈的压入顺序，序列4,5,3,2,1是该压栈序列对应的一个弹出序列，但4,3,5,1,2就不可能是该压栈序列的弹出序列。

import java.util.Scanner;
import java.util.Stack;

public class IsPopOrder {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scanner = new Scanner(System.in);
        System.out.println("the size of array:");
        int n = scanner.nextInt();
        int[] pushA = new int[n];
        int[] popA = new int[n];
        System.out.println("input pushA:");
        for(int i=0;i<n;i++){
            pushA[i] = scanner.nextInt();
        }
        System.out.println("input popA:");
        for(int i=0;i<n;i++){
            popA[i] = scanner.nextInt();
        }
        System.out.println("popA is a popOrder?:" + IsPopOrder(pushA, popA));
    }

    public static 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 < pushA.length; i++) {
            stack.push(pushA[i]);
            while (j < popA.length && stack.peek() == popA[j]) {
                stack.pop();
                j++;
            }
        }
        return stack.empty();
    }

}