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

One-Hot Encoding

Turn categories into vectors with a single 1, the input format for classifiers and embeddings.

Ce que vous allez apprendre

  • Map categories to vector positions
  • Build one-hot rows for each label
  • Prepare categorical data for models

Problème

Afficher la traduction

Models need numbers, not words. One-hot encoding turns each category into a vector with one position per category: 1 at the category's position and 0 everywhere else.

Order the categories alphabetically. For each label, output its one-hot vector.

Implement one_hot(labels).

Input

labels: A list of category names.

Output

Return a matrix with one row per label and one column per distinct category (alphabetical order).

Contraintes

1 ≤ length ≤ 1,000

Each label is 1 to 20 characters

Exemples

Exemple 1
Entrée :
labels = ["red", "green", "blue", "green"]

Sortie attendue :
expected = [
    [0, 0, 1],
    [0, 1, 0],
    [1, 0, 0],
    [0, 1, 0]
]
Entrée :
std::vector<std::string> labels = {"red", "green", "blue", "green"};

Sortie attendue :
std::vector<std::vector<long long>> expected = {
    {0, 0, 1},
    {0, 1, 0},
    {1, 0, 0},
    {0, 1, 0}
};
Entrée :
string[] labels = new string[] {"red", "green", "blue", "green"};

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

Explication

The categories in alphabetical order are blue, green, red. So red → [0, 0, 1], green → [0, 1, 0] and blue → [1, 0, 0].

Exemple 2
Entrée :
labels = ["yes"]

Sortie attendue :
expected = [
    [1]
]
Entrée :
std::vector<std::string> labels = {"yes"};

Sortie attendue :
std::vector<std::vector<long long>> expected = {
    {1}
};
Entrée :
string[] labels = new string[] {"yes"};

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

Explication

There is only one category, so every vector is [1].

Comment l'aborder

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

Indice 1

Find the distinct categories first, then sort them alphabetically to define the column order.

Indice 2

For each label, place a 1 only in the column matching that label and 0 everywhere else.

Indice 3

Make sure duplicate labels produce identical rows, since the output has one row per input label.

Complexité attendue

O(n log k) time, O(nk) 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.