समस्या
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 के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।