Условие
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).
Ограничения
1 ≤ length ≤ 1,000
Each label is 1 to 20 characters
Примеры
Ввод:
labels = ["red", "green", "blue", "green"]
Ожидаемый вывод:
expected = [
[0, 0, 1],
[0, 1, 0],
[1, 0, 0],
[0, 1, 0]
]
Ввод:
std::vector<std::string> labels = {"red", "green", "blue", "green"};
Ожидаемый вывод:
std::vector<std::vector<long long>> expected = {
{0, 0, 1},
{0, 1, 0},
{1, 0, 0},
{0, 1, 0}
};
Ввод:
string[] labels = new string[] {"red", "green", "blue", "green"};
Ожидаемый вывод:
long[][] expected = new long[][] {
new long[] {0, 0, 1},
new long[] {0, 1, 0},
new long[] {1, 0, 0},
new long[] {0, 1, 0}
};
Пояснение
The categories in alphabetical order are blue, green, red. So red → [0, 0, 1], green → [0, 1, 0] and blue → [1, 0, 0].
Ввод:
labels = ["yes"]
Ожидаемый вывод:
expected = [
[1]
]
Ввод:
std::vector<std::string> labels = {"yes"};
Ожидаемый вывод:
std::vector<std::vector<long long>> expected = {
{1}
};
Ввод:
string[] labels = new string[] {"yes"};
Ожидаемый вывод:
long[][] expected = new long[][] {
new long[] {1}
};
Пояснение
There is only one category, so every vector is [1].
Как подступиться
Сначала попробуйте сами, затем открывайте подсказки по одной.
Подсказка 1
Find the distinct categories first, then sort them alphabetically to define the column order.
Подсказка 2
For each label, place a 1 only in the column matching that label and 0 everywhere else.
Подсказка 3
Make sure duplicate labels produce identical rows, since the output has one row per input label.
Ожидаемая сложность
O(n log k) time, O(nk) extra space
Ссылки
Это задание адаптировано для CodeUtility. Следуйте условию и ограничениям выше.