Problem
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.
Einschränkungen
−1000 ≤ red, green, blue ≤ 1000
Beispiele
Eingabe:
red = 200
green = 120
blue = 75
Erwartete Ausgabe:
expected = [125, 45, 0]
Eingabe:
long long red = 200;
long long green = 120;
long long blue = 75;
Erwartete Ausgabe:
std::vector<long long> expected = {125, 45, 0};
Eingabe:
long red = 200;
long green = 120;
long blue = 75;
Erwartete Ausgabe:
long[] expected = new long[] {125, 45, 0};
Erläuterung
The smallest value is 75, so the result is [125, 45, 0].
Eingabe:
red = 90
green = 90
blue = 90
Erwartete Ausgabe:
expected = [0, 0, 0]
Eingabe:
long long red = 90;
long long green = 90;
long long blue = 90;
Erwartete Ausgabe:
std::vector<long long> expected = {0, 0, 0};
Eingabe:
long red = 90;
long green = 90;
long blue = 90;
Erwartete Ausgabe:
long[] expected = new long[] {0, 0, 0};
Erläuterung
A pure gray color loses everything: [0, 0, 0].
So gehst du vor
Versuch es zuerst allein und öffne dann einen Hinweis nach dem anderen.
Hinweis 1
Check the range of all three values before doing any math.
Hinweis 2
The gray part is the smallest of the three channels.
Hinweis 3
Subtract that same amount from each channel.
Erwartete Komplexität
O(1) time, O(1) extra space
Referenzen
Diese Aufgabe wurde für CodeUtility angepasst. Beachte die oben genannten Vorgaben und Einschränkungen.