(a, b) => { if (a.idx !== b.idx) { return a.idx - b.idx; } return a.name.localeCompare(b.name); }); for (const name of bizNames) { const words = name.toLowerCase().split(" "); let idx = Number.MAX_SAFE_INTEGER; // Check each word for the prefix with minimum index. for (let i = 0; i < words.length; i++) { if (words[i].startsWith(prefix.toLowerCase())) { idx = Math.min(idx, i); } } // If at least one word matches, add to the heap. if (idx !== Number.MAX_SAFE_INTEGER) { heap.enqueue({ idx, name }); } } const result: string[] = []; for (let i = 0; i < k && !heap.isEmpty(); i++) { result.push(heap.dequeue().name); } return result; } } 19:T7ee,#include #include #include #include #include #include #include using namespace std; class BizEntry { public: int index; string name; BizEntry(int index, const string &name) : index(index), name(name) {} }; struct BizEntryCompare { bool operator()(const BizEntry &a, const BizEntry &b) const { // Sorts by occurrence index first, then lexicographically. if (a.index != b.index) { return a.index > b.index; } return a.name > b.name; } }; class Solution { public: vector topKNames(vector bizNames, string prefix, int k) { // Sorts by occurrence index first, then lexicographically. priority_queue, BizEntryCompare> heap; // normalize prefix to lowercase transform(prefix.begin(), prefix.end(), prefix.begin(), ::tolower); for (const auto &name : bizNames) { string lowerName = name; transform(lowerNam

AI Assistant