360前端笔试两道题自测都能过 结果 0.09 求解答

var n = line[0];
var m = line[1];
var data = [];
var j = 0;
var i = 0;
for(i = 0; i < n; i++){
data[i] = read_line().split(" ");
}
var num = 0;
var cur = 0;
var total = 0;
for(i = 0; i < n; i++){
for(j = 0; j < m; j++){
cur = parseInt( data[i][j] );
total += cur;
if( cur > 1 ){
num += (cur-1) * 2;
}
if( j != m - 1){
num += Math.min(cur,data[i][j+1])*2;
}
}
}

for(j = 0; j < m; j++){
for(i = 0; i < m; i++){
cur = parseInt( data[i][j] );
if( i != n - 1){
num += Math.min(cur,data[i+1][j])*2;
}
}
}
print( parseInt( total*6 - num ))

求取模重组数组
var line = read_line().split(" ");
var n = parseInt( line[0] );
var m = parseInt( line[1] );
var data1 = read_line().split(" ");
var data2 = read_line().split(" ");
data1 = data1.map( item => {
if(item.length != 0){
return parseInt(item);
}
})
data1.splice(-1,1);
data2 = data2.map( item => {
if(item.length != 0){
return parseInt(item);
}
})
var data = [];
var j = 0;
var i = 0;
var k = m - 1;
while(k > 1){
for( i = 0; i < n; i++){
for(j = 0; j < n; j++){
if( (data1[i] + data2[j] ) %  m == (k)){
data.push([data1[i],data2[j]]);
data2.splice(j,1);
data1.splice(i,1);
}
}
}
k--;
}

data = data.map( item => ( item[0] + item[1] ) % m)
print(data.join(" "));
求解答 哭了



#360公司##笔试题目#