Problem
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.
Einschränkungen
0 ≤ rows, cols ≤ 100
0 ≤ pixel ≤ 255
Beispiele
Eingabe:
image = [
[1, 2, 3],
[4, 5, 6]
]
Erwartete Ausgabe:
expected = [
[3, 2, 1],
[6, 5, 4]
]
Eingabe:
std::vector<std::vector<long long>> image = {
{1, 2, 3},
{4, 5, 6}
};
Erwartete Ausgabe:
std::vector<std::vector<long long>> expected = {
{3, 2, 1},
{6, 5, 4}
};
Eingabe:
long[][] image = new long[][] {
new long[] {1, 2, 3},
new long[] {4, 5, 6}
};
Erwartete Ausgabe:
long[][] expected = new long[][] {
new long[] {3, 2, 1},
new long[] {6, 5, 4}
};
Erläuterung
Each row is reversed on its own: [3, 2, 1] and [6, 5, 4].
Eingabe:
image = [
[9, 0, 9, 0]
]
Erwartete Ausgabe:
expected = [
[0, 9, 0, 9]
]
Eingabe:
std::vector<std::vector<long long>> image = {
{9, 0, 9, 0}
};
Erwartete Ausgabe:
std::vector<std::vector<long long>> expected = {
{0, 9, 0, 9}
};
Eingabe:
long[][] image = new long[][] {
new long[] {9, 0, 9, 0}
};
Erwartete Ausgabe:
long[][] expected = new long[][] {
new long[] {0, 9, 0, 9}
};
Erläuterung
One row of four pixels reversed: [0, 9, 0, 9].
So gehst du vor
Versuch es zuerst allein und öffne dann einen Hinweis nach dem anderen.
Hinweis 1
The rows stay in order; only the pixels inside each row move.
Hinweis 2
Pixel c trades places with pixel cols − 1 − c.
Hinweis 3
If you swap in place, stop at the middle of the row.
Erwartete Komplexität
O(rows × cols) time, O(rows × cols) extra space
Referenzen
Diese Aufgabe wurde für CodeUtility angepasst. Beachte die oben genannten Vorgaben und Einschränkungen.