問題
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 つずつ開いてみましょう。
ヒント 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用に調整されています。上記の説明と制約に従ってください。