求QList 删除元素比较高效的算法问题

[振星]

比方有有个数组QList中存放结构体，如QList<StructInfo> ,代码如下：

StructInfo 代码如下

struct StructInfo
{
    QString key;
    QString value1;
  QString value2;
  int arg1;
  int arg2;
  ...;  
}

当QList 数组存放比较大的数据（超过1W条时），我希望可以根据key删除QList中所有结构体的key等于传入的key，
请问应该怎么做比较合理？

[童心未泯的cuzn]

你的struct是固定了还是啥？我感觉，做个二级链表应该就可以了。

[乔巴好萌]

QList只能遍历 你无论怎么优化 都是需要遍历至少一遍的 也就是你的复杂度至少是o(n) 其实这个已经算比较低的了 除非你改成QMap

[donwmufromdying]

你用QHash吧

[tyousi]

QMap<QString, StructInfo> map; map[key] = StructInfo(); map.remove(key);

[Inhibitory]

bool QList::removeOne(const T & value) Removes the first occurrence of value in the list and returns true on success; otherwise returns false. Example: QList<QString> list; list << "sun" << "cloud" << "sun" << "rain"; list.removeOne("sun"); // list: ["cloud", ,"sun", "rain"] This function requires the value type to have an implementation of operator==(). This function was introduced in Qt 4.4.

#include <QList>
#include <QDebug>
#include <QString>

struct StructInfo {
    QString key;
    QString value1;
    QString value2;
    int arg1;
    int arg2;

    StructInfo() {

    }

    StructInfo(const QString &key, int arg1) {
        this->key = key;
        this->arg1 = arg1;
    }

    bool operator==(const StructInfo &other) const {
        return this->key == other.key;
    }
};

int main(int argc, char *argv[]) {
    QList<StructInfo> list;

    list.append(StructInfo("One", 1));
    list.append(StructInfo("Tow", 2));
    list.append(StructInfo("Three", 3));

    for (StructInfo info : list) {
        qDebug() << info.arg1;
    }

    qDebug() << "------------------------";

    list.removeOne(StructInfo("One", 1));

    for (StructInfo info : list) {
        qDebug() << info.arg1;
    }

    return 0;
}

[Jiao319]

qmap或者重载结构体的==操作。都被别人说了