問題
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 つずつ開いてみましょう。
ヒント 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用に調整されています。上記の説明と制約に従ってください。