📅  最后修改于: 2022-03-11 15:02:20.235000             🧑  作者: Mango
function crossAdd(input) {
var answer = [];
for (var i = 0; i < input.length; i++) {
var goingUp = input[i];
var goingDown = input[input.length-1-i];
answer.push(goingUp + goingDown);
}
return answer;
}
// O(N) time complexity