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.
Restrições
0 ≤ rows, cols ≤ 100
0 ≤ pixel ≤ 255
Exemplos
Entrada:
image = [
[1, 2, 3],
[4, 5, 6]
]
Saída esperada:
expected = [
[3, 2, 1],
[6, 5, 4]
]
Entrada:
std::vector<std::vector<long long>> image = {
{1, 2, 3},
{4, 5, 6}
};
Saída 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}
};
Saída esperada:
long[][] expected = new long[][] {
new long[] {3, 2, 1},
new long[] {6, 5, 4}
};
Explicação
Each row is reversed on its own: [3, 2, 1] and [6, 5, 4].
Entrada:
image = [
[9, 0, 9, 0]
]
Saída esperada:
expected = [
[0, 9, 0, 9]
]
Entrada:
std::vector<std::vector<long long>> image = {
{9, 0, 9, 0}
};
Saída esperada:
std::vector<std::vector<long long>> expected = {
{0, 9, 0, 9}
};
Entrada:
long[][] image = new long[][] {
new long[] {9, 0, 9, 0}
};
Saída esperada:
long[][] expected = new long[][] {
new long[] {0, 9, 0, 9}
};
Explicação
One row of four pixels reversed: [0, 9, 0, 9].
Como abordar
Tente sozinho primeiro e depois abra uma dica de cada vez.
Dica 1
The rows stay in order; only the pixels inside each row move.
Dica 2
Pixel c trades places with pixel cols − 1 − c.
Dica 3
If you swap in place, stop at the middle of the row.
Complexidade esperada
O(rows × cols) time, O(rows × cols) extra space
Referências
Este desafio foi adaptado para o CodeUtility. Siga o enunciado e as restrições acima.