给定入栈顺序，判断出栈顺序是否正确。

var ins = [1, 2, 3, 4, 5];
var outs = [3, 4, 5, 2, 1];
var temp = ins;
var num, i = 0, len;

/**
 * ins 入栈顺序
 * outs 出栈顺序
 * temp 临时数组，保存入栈顺序
 * num 是临时数组中 当前出栈节点的下标
 * len 临时数组的长度-1
 * 
 */
(function (temp, outs) {
    if(ins == null || temp == null){
        console.log("不能为空");
    }
    for (i = 0; i < outs.length; i++) {
        num = temp.indexOf(outs[i]);
        len = temp.length - 1;
        if (num > 0 || num < len) {
            if ((outs[i + 1] == temp[num - 1]) || (outs[i + 1] == temp[num + 1])) {
                temp.splice(num, 1);
                continue;
            }
            console.log('不是正确的出栈顺序');
            return false;
        } else if (num == 0) {
            if (outs[i + 1] == temp[num + 1]) {
                temp.splice(num, 1);
                continue;
            }
            console.log('不是正确的出栈顺序');
            return false;
        } else if (num == len) {
            if (outs[i + 1] == tem[num - 1]) {
                temp.splice(num, 1);
                continue;
            }
            console.log('不是正确的出栈顺序');
            return false;
        } else {
            console.log('不是正确的出栈顺序');
            return false;
        }
    }
    console.log("正确");
})(temp, outs);