Seu programa deve ter uma matriz como entrada.

A matriz:

1. Sempre será unidimensional
2. Contém apenas números inteiros
3. Pode estar vazio

O programa deve reverter a matriz e adicione os elementos ao original, por exemplo:

Entrada: [1, 2, 3]

Original: [1, 2, 3]

Invertida: [3, 2, 1]

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

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

Saída: [4, 4, 4]

Casos de teste:

#In             #Out
[8, 92],        [100, 100]
[1, 2, 3],      [4, 4, 4]
[5, 24, 85, 6], [11, 109, 109, 11]
[],             []
[999],          [1998]

Este é o código-golfe , o código mais curto (em bytes) vence!

Haskell , 20 bytes

Economize 5 bytes mudando para um ponto livre, conforme sugerido por nimi

zipWith(+)=<<reverse

Experimente online!

Geléia , 2 bytes

+U

Experimente online!

ou

+Ṛ

Experimente online! (obrigado @Mr. Xcoder pelo segundo programa)

explicação, embora seja bastante auto-explicativa

+U  Main link
+   Add, vectorizing, 
 U                    the input, reversed

+Ṛ  Main link
+   Add, vectorizing,
 Ṛ                    the input, reversed, without vectorizing (same thing for depth-1 lists)

Para uma matriz vazia [], isso não gera nada. Está correto. A representação de Jelly de uma lista vazia é simplesmente nada. Observe que a representação de Jelly de uma lista com um único elemento é apenas o próprio elemento. Anexe ŒṘao código para ver a representação interna do Python da saída.

JavaScript (ES6), 27 bytes

a=>[...a].map(e=>e+a.pop())

f=
a=>[...a].map(e=>e+a.pop())

console.log(f([8, 92])) // [100, 100]
console.log(f([1, 2, 3])) // [4, 4, 4]
console.log(f([5, 24, 85, 6])) // [11, 109, 109, 11]
console.log(f([])) // []
console.log(f([999])) //[1998]

05AB1E , 2 bytes

Â+

Experimente online!

Python 2, 32 bytes

lambda l:map(sum,zip(l,l[::-1]))

Solução alternativa sem zip(35 bytes):

lambda l:map(int.__add__,l,l[::-1])

Experimente online!

Python 2 , 40 bytes

lambda l:[i+j for i,j in zip(l,l[::-1])]

Experimente online!

A outra resposta Python mais curta substitui a compreensão da lista map. Gostaria de ter pensado em fazer isso mais rápido. ; -;

Japonês , 7 bytes

mÈ+Ug~Y

Experimente online! com o -Qsinalizador para formatar a matriz de saída.

Explicação

Implícito: U= matriz de entrada

mÈ

Mapeie a entrada pela seguinte função ...

+Ug

O valor, mais o valor na matriz de entrada no índice ...

~Y

-(index+1), que obtém elementos do final da matriz.

Ruby, 25 bytes

->a{[*a].map{|i|i+a.pop}}

Try it online!

Mathematica, 12 bytes

Reverse@#+#&

Try it online!

Python 2, 33 32 bytes

-1 byte thanks to @xnor

lambda l:[i+l.pop()for i in l*1]

Try it online!

Brachylog, 6 bytes

↔;?z+ᵐ

Try it online!

C# (.NET Core), 61 60 bytes

-1 byte thanks to TheLethalCoder

a=>a.Reverse().Zip(a,(x,y)=>x+y).ToArray()

Try it online!

Byte count also includes:

using System.Linq;

For explanation - Zip function in LINQ takes two collections and executes given function for all corresponding elements, ie. both first elements together, both second elements etc.

CJam, 7 bytes

{_W%.+}

Try it online!

APL (Dyalog), 3 bytes

⌽+⊢

Try it online!

Explanation

⌽          The argument reversed
+           Plus
⊢          The argument

J, 3 bytes

+|.

Reverse, sum.

Try it online!

R, 17 16 bytes

-1 byte thanks to djhurio

rev(l<-scan())+l

Reads from stdin; returns the vector; numeric(0) is the zero-length numeric vector for the empty list.

Try it online!

Clojure, 20 17 bytes

3 bytes saved thanks to @MattPutnam

#(map +(rseq %)%)

Seems to be quite competitive with non-golfing languages.

See it online

Pyth, 3 bytes

+V_

Try it here.

PowerShell, 26 bytes

($a=$args)|%{+$a[--$i]+$_}

Try it online!

Takes input as command-line arguments.

C, 49 bytes

f(a,n,b)int*a,*b;{for(b=a+n;a<b--;a++)*a=*b+=*a;}

PowerShell, 40 32 bytes

($n=$args)|%{$n[-++$i]+$n[$i-1]}

Try it online!

Takes input as individual command-line arguments, which is allowed as one of the native list format for PowerShell. Then loops through each element (i.e., a shorter way of looping through the indices), adding the element counting from the back (-1 indexed) to the current element (0 indexed, hence the decrement -1). Those are left on the pipeline and output is implicit.

Saved 8 bytes thanks to @briantist

Java 8, 61 57 56 53 bytes

a->{for(int l=0,r=a.length;l<r;a[l]=a[--r]+=a[l++]);}

-1 byte and bug-fixed thanks to @Nevay.
-3 bytes thanks to @OliverGrégoire.

(It was a port of (and golfed by 4 8 bytes) of @jkelm's C# answer, but now it's a different shorter solution thanks to @OliverGrégoire.)

Explanation:

Try it here.

The method modifies the input-array to save bytes, so no need for a return-type.

a->{                    // Method with integer-array parameter and no return-type
  for(int l=0,          //  Left-integer (starting at 0)
          r=a.length;   //  Right-integer (starting at the length of the input-array)
      l<r;              //  Loop as long as left is smaller than right
    a[l]=               //   Change the number at the current left index to:
         a[--r]+=a[l++] //    The number at the right index + itself
                        //    (The += adds the number at the left index also to the right index)
                        //    (And the --/++ increases/decreases the indexes by 1,
                        //     until we've reached the middle of the array)
  );                    //  End of loop
}                       // End of method

Ohm, 3 bytes

DR+

Try it online!

Actually, 4 bytes

;R♀+

Try it online!

anyfix, 3 bytes

"U+

The version on TryItOnline! is an outdated version of anyfix, which contains a few fatal errors such as not being able to add lists because of typos in the source code. Use the code on GitHub instead.

"U+  Program
"    Duplicate top of stack
 U   Reverse top of stack if it is a list (which it should be...)
  +  Add, vectorizing for lists

Neim, 2 bytes

This is a function that takes input on the top of the stack and outputs on the top of the stack.

𝕓𝔻

Try it online!

Röda, 22 bytes

{reverse(_)<>_1|[_+_]}

Try it online!

This is an anonymous function that takes in an array and returns a stream of values, which the TIO link outputs separated over newlines.

Explanation

reverse(_)          The array reversed
<>                  interleaved with
_1                  the array itself
                    Push each element to the stream
[_+_]               Pull two values and push their sum

JavaScript (ES6), 34 33 bytes

Saved a byte thanks to @ETHproductions.

a=>a.map((e,i)=>e+a[a.length+~i])

let f=

a=>a.map((e,i)=>e+a[a.length+~i])

console.log(f([8,92]));
console.log(f([1,2,3]));
console.log(f([5, 24, 85, 6]));
console.log(f([]));
console.log(f([999]));

MATL, 3 bytes

tP+

Try it online!

Extremely straightforward. t duplicates the input. P flips (reverses) it, and + adds the two arrays element wise.

PHP, 59 bytes

for(;a&$c=$argv[++$i];)$a[]=$c+$argv[$argc-$i];print_r($a);

takes input from command line arguments; empty output for empty input

Yields a warning in PHP>7.0. This version does not (60 bytes):

for(;++$i<$argc;)$a[]=$argv[$i]+$argv[$argc-$i];print_r($a);