每行填充二维数组

我有一个返回一维数组的函数(getCoeff()(。我尝试使用它来填充二维数组：

//set up an 3x3 array for A
A = new Array(3);
for (var i=0; i<3; i++) {
    A[i] = new Array(3);
}
//fill it per row using getCoeff()
for (var i=0; i<3; i++) {
        A[i] = getCoeff(i+1);
}
console.log(A);
console.log(getCoeff(1));
console.log(getCoeff(2));
console.log(getCoeff(3));

但我只填满了第一行，其他两行仍然是空的：

[ [ -3, 2, -1 ], [ , ,  ], [ , ,  ] ]
[ -3, 2, -1 ]
[ 2, -3, 2 ]
[ 1, -1, 3 ]

如您所见，该函数正确返回行，但由于某种原因，它在循环中不起作用。

另一方面，如果我尝试这样的事情：

for (var i=0; i<3; i++) {
        A[i] = [1,2,3];
}
console.log(A);

它工作正常！

[ [ 1, 2, 3 ], [ 1, 2, 3 ], [ 1, 2, 3 ] ]

我的代码怎么了？！

更新：

我在编辑前的原始完整代码：

    var fs = require('fs');
    var input = "LPinput.txt";
    var c = new Array();
    var A = new Array();
    var b = new Array();
    var Eqin = new Array();
    var MinMax;
    open(input);
    console.log(c);
    console.log(A);
    console.log(b);
    console.log(Eqin);
    console.log(MinMax);
    function open(filename) {
        if (fs.existsSync(filename)) {
           var data = fs.readFileSync(filename).toString().split("'n");
           analyse(data);
        } else {
           console.log("ERROR: File doesnt exist!");
        }
    }
    function analyse(data) {
        //clean up whitespaces
        for (i in data) {
            data[i] = data[i].replace(/'s/g, '');       
        }   
        //check LP type & clean up
        if (data[0].substring(0,3) == "max") {
            MinMax = 1;
            data[0] = data[0].replace("max","");
        } else if (data[0].substring(0,3) == "min") {
            MinMax = -1;
            data[0] = data[0].replace("min","");
        } else {
            console.log("ERROR: Invalid format!");
            return;
        }
        //check constraints format & clean up
        if ( data[1].substring(0,4) != "s.t.") {
            console.log("ERROR: Invalid format!");
            return;
        } else {
            data[1] = data[1].replace("s.t.","");
        }
        //get variables 
        var variables = data[data.length-1].split(",");
        var last = variables[variables.length-1];
        variables[variables.length-1] = last.substring(0,last.indexOf(">"));
        //get number of constraints
        var constraints = data.length-2;
        c = getCoeff(0);
            //===============================
            //I JUST NEED TO POPULATE A TO FINISH THIS
        for (var i=0; i<constraints; i++) {
            A[i] = getCoeff(i+1);
        }   
            //===============================
        for (var i=1; i<data.length-1; i++) {
            var end = data[i].length;
            var start = end;
            while (data[i].charAt(start) != "=") {
                 start = start - 1;
            }
            b[i-1] = parseInt(data[i].substring(start+1,end));
            if (data[i].charAt(start-1) == "<") {
                Eqin[i-1]=-1;
            } else if (data[i].charAt(start-1) == ">") {
                Eqin[i-1]=1;
            } else {
                Eqin[i-1]=0;
            }
        }
        function getCoeff(row) {
            var coeff = new Array();
            for (i in variables) {
                var pos = data[row].indexOf(variables[i]);
                if ((data[row].charAt(pos-1) == "+") || (pos-1 < 0)) {
                    coeff[i]=1;
                } else if (data[row].charAt(pos-1) == "-") {
                    coeff[i]=-1;
                } else if (data[row].charAt(pos-1) == "*") {
                    var end = pos-1;
                    var start = end;
                    while ( (start > -1) && (data[row].charAt(start) != "+") && (data[row].charAt(start) != "-") ) {
                        start = start - 1;
                    }
                    coeff[i] = parseInt((data[row].substring(start,end)));
                }
            }
            return coeff;
        }
    }

LP输入.txt：

max 2*x1+x2-4*x3-15
s.t.-3*x1+2*x2-x3>=5
    2*x1-3*x2+2*x3<=9
    x1-x2+3*x3<=5
    x1,x2,x3>=0

更新#2：

控制台输出：

[ 2, 1, -4 ]
[ [ -3, 2, -1 ] ]
[ 5, 9, 5 ]
[ 1, -1, -1 ]
1

它应该是：

[ 2, 1, -4 ]
[ [ -3, 2, -1 ],[ 2, -3, 2 ],[ 1, -1, 3 ]]
[ 5, 9, 5 ]
[ 1, -1, -1 ]
1