Условие
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.
Ограничения
0 ≤ rows, cols ≤ 100
0 ≤ pixel ≤ 255
Примеры
Ввод:
image = [
[1, 2, 3],
[4, 5, 6]
]
Ожидаемый вывод:
expected = [
[3, 2, 1],
[6, 5, 4]
]
Ввод:
std::vector<std::vector<long long>> image = {
{1, 2, 3},
{4, 5, 6}
};
Ожидаемый вывод:
std::vector<std::vector<long long>> expected = {
{3, 2, 1},
{6, 5, 4}
};
Ввод:
long[][] image = new long[][] {
new long[] {1, 2, 3},
new long[] {4, 5, 6}
};
Ожидаемый вывод:
long[][] expected = new long[][] {
new long[] {3, 2, 1},
new long[] {6, 5, 4}
};
Пояснение
Each row is reversed on its own: [3, 2, 1] and [6, 5, 4].
Ввод:
image = [
[9, 0, 9, 0]
]
Ожидаемый вывод:
expected = [
[0, 9, 0, 9]
]
Ввод:
std::vector<std::vector<long long>> image = {
{9, 0, 9, 0}
};
Ожидаемый вывод:
std::vector<std::vector<long long>> expected = {
{0, 9, 0, 9}
};
Ввод:
long[][] image = new long[][] {
new long[] {9, 0, 9, 0}
};
Ожидаемый вывод:
long[][] expected = new long[][] {
new long[] {0, 9, 0, 9}
};
Пояснение
One row of four pixels reversed: [0, 9, 0, 9].
Как подступиться
Сначала попробуйте сами, затем открывайте подсказки по одной.
Подсказка 1
The rows stay in order; only the pixels inside each row move.
Подсказка 2
Pixel c trades places with pixel cols − 1 − c.
Подсказка 3
If you swap in place, stop at the middle of the row.
Ожидаемая сложность
O(rows × cols) time, O(rows × cols) extra space
Ссылки
Это задание адаптировано для CodeUtility. Следуйте условию и ограничениям выше.