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.
Vincoli
0 ≤ rows, cols ≤ 100
0 ≤ pixel ≤ 255
Esempi
Input:
image = [
[1, 2, 3],
[4, 5, 6]
]
Output atteso:
expected = [
[3, 2, 1],
[6, 5, 4]
]
Input:
std::vector<std::vector<long long>> image = {
{1, 2, 3},
{4, 5, 6}
};
Output atteso:
std::vector<std::vector<long long>> expected = {
{3, 2, 1},
{6, 5, 4}
};
Input:
long[][] image = new long[][] {
new long[] {1, 2, 3},
new long[] {4, 5, 6}
};
Output atteso:
long[][] expected = new long[][] {
new long[] {3, 2, 1},
new long[] {6, 5, 4}
};
Spiegazione
Each row is reversed on its own: [3, 2, 1] and [6, 5, 4].
Input:
image = [
[9, 0, 9, 0]
]
Output atteso:
expected = [
[0, 9, 0, 9]
]
Input:
std::vector<std::vector<long long>> image = {
{9, 0, 9, 0}
};
Output atteso:
std::vector<std::vector<long long>> expected = {
{0, 9, 0, 9}
};
Input:
long[][] image = new long[][] {
new long[] {9, 0, 9, 0}
};
Output atteso:
long[][] expected = new long[][] {
new long[] {0, 9, 0, 9}
};
Spiegazione
One row of four pixels reversed: [0, 9, 0, 9].
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
The rows stay in order; only the pixels inside each row move.
Suggerimento 2
Pixel c trades places with pixel cols − 1 − c.
Suggerimento 3
If you swap in place, stop at the middle of the row.
Complessità attesa
O(rows × cols) time, O(rows × cols) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.