Problema
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.
Vincoli
−1000 ≤ red, green, blue ≤ 1000
Esempi
Input:
red = 200
green = 120
blue = 75
Output atteso:
expected = [125, 45, 0]
Input:
long long red = 200;
long long green = 120;
long long blue = 75;
Output atteso:
std::vector<long long> expected = {125, 45, 0};
Input:
long red = 200;
long green = 120;
long blue = 75;
Output atteso:
long[] expected = new long[] {125, 45, 0};
Spiegazione
The smallest value is 75, so the result is [125, 45, 0].
Input:
red = 90
green = 90
blue = 90
Output atteso:
expected = [0, 0, 0]
Input:
long long red = 90;
long long green = 90;
long long blue = 90;
Output atteso:
std::vector<long long> expected = {0, 0, 0};
Input:
long red = 90;
long green = 90;
long blue = 90;
Output atteso:
long[] expected = new long[] {0, 0, 0};
Spiegazione
A pure gray color loses everything: [0, 0, 0].
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Check the range of all three values before doing any math.
Suggerimento 2
The gray part is the smallest of the three channels.
Suggerimento 3
Subtract that same amount from each channel.
Complessità attesa
O(1) time, O(1) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.