Problema
The mirror button in a photo app swaps the left and right sides of a picture. The first pixel of every row trades places with the last one, the second with the second to last, and so on. The order of the rows does not change.
Implement mirror_image(image).
Input
image: The picture as a list of rows of pixel values; every row has the same length.
Output
Return a new grid where each row is the original row in reverse order. An empty picture gives an empty list.
Restricciones
0 ≤ rows, cols ≤ 100
0 ≤ pixel ≤ 255
Ejemplos
Entrada:
image = [
[1, 2, 3],
[4, 5, 6]
]
Salida esperada:
expected = [
[3, 2, 1],
[6, 5, 4]
]
Entrada:
std::vector<std::vector<long long>> image = {
{1, 2, 3},
{4, 5, 6}
};
Salida esperada:
std::vector<std::vector<long long>> expected = {
{3, 2, 1},
{6, 5, 4}
};
Entrada:
long[][] image = new long[][] {
new long[] {1, 2, 3},
new long[] {4, 5, 6}
};
Salida esperada:
long[][] expected = new long[][] {
new long[] {3, 2, 1},
new long[] {6, 5, 4}
};
Explicación
Each row is reversed on its own: [3, 2, 1] and [6, 5, 4].
Entrada:
image = [
[9, 0, 9, 0]
]
Salida esperada:
expected = [
[0, 9, 0, 9]
]
Entrada:
std::vector<std::vector<long long>> image = {
{9, 0, 9, 0}
};
Salida esperada:
std::vector<std::vector<long long>> expected = {
{0, 9, 0, 9}
};
Entrada:
long[][] image = new long[][] {
new long[] {9, 0, 9, 0}
};
Salida esperada:
long[][] expected = new long[][] {
new long[] {0, 9, 0, 9}
};
Explicación
One row of four pixels reversed: [0, 9, 0, 9].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
The rows stay in order; only the pixels inside each row move.
Pista 2
Pixel c trades places with pixel cols − 1 − c.
Pista 3
If you swap in place, stop at the middle of the row.
Complejidad esperada
O(rows × cols) time, O(rows × cols) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.