Problème
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.
Contraintes
0 ≤ rows, cols ≤ 100
0 ≤ pixel ≤ 255
Exemples
Entrée :
image = [
[1, 2, 3],
[4, 5, 6]
]
Sortie attendue :
expected = [
[3, 2, 1],
[6, 5, 4]
]
Entrée :
std::vector<std::vector<long long>> image = {
{1, 2, 3},
{4, 5, 6}
};
Sortie attendue :
std::vector<std::vector<long long>> expected = {
{3, 2, 1},
{6, 5, 4}
};
Entrée :
long[][] image = new long[][] {
new long[] {1, 2, 3},
new long[] {4, 5, 6}
};
Sortie attendue :
long[][] expected = new long[][] {
new long[] {3, 2, 1},
new long[] {6, 5, 4}
};
Explication
Each row is reversed on its own: [3, 2, 1] and [6, 5, 4].
Entrée :
image = [
[9, 0, 9, 0]
]
Sortie attendue :
expected = [
[0, 9, 0, 9]
]
Entrée :
std::vector<std::vector<long long>> image = {
{9, 0, 9, 0}
};
Sortie attendue :
std::vector<std::vector<long long>> expected = {
{0, 9, 0, 9}
};
Entrée :
long[][] image = new long[][] {
new long[] {9, 0, 9, 0}
};
Sortie attendue :
long[][] expected = new long[][] {
new long[] {0, 9, 0, 9}
};
Explication
One row of four pixels reversed: [0, 9, 0, 9].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
The rows stay in order; only the pixels inside each row move.
Indice 2
Pixel c trades places with pixel cols − 1 − c.
Indice 3
If you swap in place, stop at the middle of the row.
Complexité attendue
O(rows × cols) time, O(rows × cols) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.