Problem
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).
Einschränkungen
1 ≤ length ≤ 1,000
Each label is 1 to 20 characters
Beispiele
Eingabe:
labels = ["red", "green", "blue", "green"]
Erwartete Ausgabe:
expected = [
[0, 0, 1],
[0, 1, 0],
[1, 0, 0],
[0, 1, 0]
]
Eingabe:
std::vector<std::string> labels = {"red", "green", "blue", "green"};
Erwartete Ausgabe:
std::vector<std::vector<long long>> expected = {
{0, 0, 1},
{0, 1, 0},
{1, 0, 0},
{0, 1, 0}
};
Eingabe:
string[] labels = new string[] {"red", "green", "blue", "green"};
Erwartete Ausgabe:
long[][] expected = new long[][] {
new long[] {0, 0, 1},
new long[] {0, 1, 0},
new long[] {1, 0, 0},
new long[] {0, 1, 0}
};
Erläuterung
The categories in alphabetical order are blue, green, red. So red → [0, 0, 1], green → [0, 1, 0] and blue → [1, 0, 0].
Eingabe:
labels = ["yes"]
Erwartete Ausgabe:
expected = [
[1]
]
Eingabe:
std::vector<std::string> labels = {"yes"};
Erwartete Ausgabe:
std::vector<std::vector<long long>> expected = {
{1}
};
Eingabe:
string[] labels = new string[] {"yes"};
Erwartete Ausgabe:
long[][] expected = new long[][] {
new long[] {1}
};
Erläuterung
There is only one category, so every vector is [1].
So gehst du vor
Versuch es zuerst allein und öffne dann einen Hinweis nach dem anderen.
Hinweis 1
Find the distinct categories first, then sort them alphabetically to define the column order.
Hinweis 2
For each label, place a 1 only in the column matching that label and 0 everywhere else.
Hinweis 3
Make sure duplicate labels produce identical rows, since the output has one row per input label.
Erwartete Komplexität
O(n log k) time, O(nk) extra space
Referenzen
Diese Aufgabe wurde für CodeUtility angepasst. Beachte die oben genannten Vorgaben und Einschränkungen.