优先级队列实现为单一链接，无法更新插入的指针转换

编辑的问题：如何将指针参考作为参数的同时插入链接列表中？我更新的代码如下：

注意：我有一个队列的副本，用于将给定节点插入正确的位置，但是我无论如何都没有看到以更新原始队列，因为没有办法链接以前的节点。

解决：工作优先级队列（FIFO） - 需要清洁

#define QUEUE_HEAD_INDICATOR 0.0
namespace
{
    pq* create_node(float priority = 0, const string & text = "")
    {
        pq* q = new pq;
        q->priority = priority;
        q->text = text;
        q->next = nullptr;
        return q;
    }
}
pq* init_priority_queue() {
    return create_node(QUEUE_HEAD_INDICATOR);
}

void insert(pq* &queue, string text, float priority) {
    if (!queue) return;
    pq* prev = queue;
    pq* cursor = queue->next;
    int offset = 0;
    if(prev->priority == 0.0 && prev->text == "") {
        prev->priority = priority;
        prev->text = text;
        return;
    }
    if(!cursor) {
        if(prev->priority > priority) {
            pq* node = create_node(priority, text);
            node->next = prev;
            prev = node;
        } else {
            pq* node = create_node(priority, text);
            prev->next = node;
        }
    } else {
        while(cursor && cursor->priority < priority) {
            prev = cursor;
            cursor = cursor->next;
            offset++;
        }
        pq* node = create_node(priority, text);
        if(offset == 0) {
            if(cursor->priority == (int)node->priority) {
                node->next = prev->next;
                prev->next = node;
                queue = prev;
            } else {
                node->next = prev;
                prev = node;
                queue = prev;
            }
        } else if(!cursor) {
            prev->next = node;
        } else {
            node->next = prev->next;
            prev->next = node;
        }
        return;
    }
}

string remove(pq* &queue) {
    pq* prev = queue;
    pq* cursor = queue->next;
    if(!queue->next) {
        string text = queue->text;
        prev = NULL;
        return text;
    }
    while(cursor->next) {
        prev = cursor;
        cursor = cursor->next;
    }
    prev->next = NULL;
    string text = cursor->text;
    return text;
}

这是结构的样子

struct pq {
    float priority;
    string text;
    pq* next;
};