Условие
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. Следуйте условию и ограничениям выше.