समस्या
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 के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।