문제
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에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.