समस्या
Every RGB color can be split into a gray part, where red, green and blue are equal, and the pure color that is left over. The gray part is as large as the smallest of the three values, so subtracting that smallest value from each channel leaves the color with its gray removed. For example (130, 50, 130) has a gray part of 50 and becomes (80, 0, 80).
Implement remove_gray_rgb(red, green, blue).
Input
red: The red value.
green: The green value.
blue: The blue value.
Output
Return [red, green, blue] after subtracting the smallest of the three from each. A channel is valid from 0 to 255; if any value is outside that range, return an empty list.
सीमाएँ
−1000 ≤ red, green, blue ≤ 1000
उदाहरण
इनपुट:
red = 200
green = 120
blue = 75
अपेक्षित आउटपुट:
expected = [125, 45, 0]
इनपुट:
long long red = 200;
long long green = 120;
long long blue = 75;
अपेक्षित आउटपुट:
std::vector<long long> expected = {125, 45, 0};
इनपुट:
long red = 200;
long green = 120;
long blue = 75;
अपेक्षित आउटपुट:
long[] expected = new long[] {125, 45, 0};
व्याख्या
The smallest value is 75, so the result is [125, 45, 0].
इनपुट:
red = 90
green = 90
blue = 90
अपेक्षित आउटपुट:
expected = [0, 0, 0]
इनपुट:
long long red = 90;
long long green = 90;
long long blue = 90;
अपेक्षित आउटपुट:
std::vector<long long> expected = {0, 0, 0};
इनपुट:
long red = 90;
long green = 90;
long blue = 90;
अपेक्षित आउटपुट:
long[] expected = new long[] {0, 0, 0};
व्याख्या
A pure gray color loses everything: [0, 0, 0].
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
Check the range of all three values before doing any math.
संकेत 2
The gray part is the smallest of the three channels.
संकेत 3
Subtract that same amount from each channel.
अपेक्षित जटिलता
O(1) time, O(1) extra space
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।