문제
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에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.