Exemplo n.º 1
0
//插入新的项并在链表里寻找与之指数相等的项,找到则相加并调用DeleteNext, 未找到则调用OrderInsert正常插入
void OrderInsertMerge(Linklist &L, term e, int (*comp)(term, term)){
    Node pre, get;
    if (LocateElem(L, e, pre, get, comp)){
        get -> data.coef += e.coef;
        if (!get -> data.coef) //若相加后的系数为0则将此节点删除
            DeleteNext(L, pre); //用此节点的前驱指针删除此节点
    }
    else
        OrderInsert(L, e, comp);
}
Exemplo n.º 2
0
    void LineEditData::DeletePrev(int times) {
        times = std::min(times, (int)cursor);

        CursorLeft(times);
        DeleteNext(times);
    }