花花酱 LeetCode 3408. Design Task Manager

所有操作都是O(logn)

class TaskManager {

public:

TaskManager(vector<vector<int>>& tasks) {

for (const auto& task : tasks)

add(task[0], task[1], task[2]);

}

void add(int userId, int taskId, int priority) {

m_[taskId] = pq_.emplace(make_pair(priority, taskId), userId).first;

}

void edit(int taskId, int newPriority) {

const int userId = m_[taskId]->second;

rmv(taskId);

add(userId, taskId, newPriority);

}

void rmv(int taskId) {

auto it = m_.find(taskId);

pq_.erase(it->second);

m_.erase(it);

}

int execTop() {

if (pq_.empty()) return -1;

auto it = pq_.rbegin();

const int userId = it->second;

const int taskId = (it->first.second);

rmv(taskId);

return userId;

}

private:

map<std::pair<int,int>, int> pq_; // (priority, taskId) -> userId;

unordered_map<int, map<std::pair<int,int>, int>::iterator> m_; // taskId -> pq iterator

};

请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.

Buy anything from Amazon to support our website
您可以通过在亚马逊上购物（任意商品）来支持我们

Paypal

Venmo
huahualeetcode

微信打赏

Be First to Comment