Tous les défis
Facile 0 résolus 0 % de réussite

Remove Gray From RGB

Remove the gray part of an RGB color by subtracting the smallest channel from all three.

Ce que vous allez apprendre

  • Validate that each channel is in range
  • Find the smallest of three values
  • Return several values as a list

Problème

Afficher la traduction

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.

Contraintes

−1000 ≤ red, green, blue ≤ 1000

Exemples

Exemple 1
Entrée :
red = 200
green = 120
blue = 75

Sortie attendue :
expected = [125, 45, 0]
Entrée :
long long red = 200;
long long green = 120;
long long blue = 75;

Sortie attendue :
std::vector<long long> expected = {125, 45, 0};
Entrée :
long red = 200;
long green = 120;
long blue = 75;

Sortie attendue :
long[] expected = new long[] {125, 45, 0};

Explication

The smallest value is 75, so the result is [125, 45, 0].

Exemple 2
Entrée :
red = 90
green = 90
blue = 90

Sortie attendue :
expected = [0, 0, 0]
Entrée :
long long red = 90;
long long green = 90;
long long blue = 90;

Sortie attendue :
std::vector<long long> expected = {0, 0, 0};
Entrée :
long red = 90;
long green = 90;
long blue = 90;

Sortie attendue :
long[] expected = new long[] {0, 0, 0};

Explication

A pure gray color loses everything: [0, 0, 0].

Comment l'aborder

Essayez d'abord seul, puis ouvrez les indices un par un.

Indice 1

Check the range of all three values before doing any math.

Indice 2

The gray part is the smallest of the three channels.

Indice 3

Subtract that same amount from each channel.

Complexité attendue

O(1) time, O(1) extra space

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

La meilleure solution validée de chaque codeur. Les plus rapides, les plus légères et les mieux notées passent devant.

Aucune solution validée pour l'instant. Résolvez-le et prenez la première place.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.