kolos123

##################### WSTAWIANIE tam gdzie int n######################
void lista::Insert(int dane, int n)
{
    Node* nowy = new Node(dane);
    if(n == 1)
    {
        nowy->next=head;
        head=nowy;
        return;
    }
    Node* temp2 = head;
    int i;
    for(i=0; i<n-2; i++)
        temp2 = temp2->next;

    nowy->next = temp2->next;
    temp2->next = nowy;
}
###################### USUWANIE W MIEJSCU N ##########################
void lista::Delete(int n)
{
    Node* temp1 = head;

    if(n==1)
    {
        head = temp1->next;
        delete temp1;
        return;
    }

    int i;
    for(i=0; i<n-2; i++)
        temp1 = temp1->next; //n-1 node

    Node* temp2 = temp1->next; //n node

    temp1->next = temp2->next;
    delete temp2;
}

#################### CIAGI #############################
void Sznur::usun(int a)
{
    Node* walker = head;
    Node* prev = NULL;
    int i;

    while(walker!=NULL)
    {
        for(i=0; i<a && walker!=NULL; i++)
        {
            prev = walker;
            walker = walker->next;
        }
        while(walker!=NULL && walker->value%2!=0)
        {
            Node* killer = walker;
            walker = walker->next;
            prev->next = walker;
            delete killer;
        }
    }

}


#################### CZWORKI #####################
void Sznur::usun() {
    int times = counter/4;
    Node* walker = head;
    int elem_1, elem_2, elem_3;

    Node* K1 = head;
    Node* K2=NULL;
    Node* K3=NULL;
    Node* K4=NULL;
    Node* prev=head;

    cout << endl << "TIMES: " << times << endl;
    for(int i=0;i<times;i++)
    {
        for(int j=0;j<4;j++)
        {
            if(j==0)
                elem_1 = walker->value;
            else if(j==1)
                elem_2 = walker->value;
            else if(j==2)
                elem_3 = walker->value;

            walker = walker->next;
        }

        K2 = K1->next;
        K3 = K2->next;
        K4 = K3->next;
        if(elem_3%elem_1==0 && elem_3%elem_2==0)
        {
            if(K1==head)
            {
                head=walker;
                delete K1;
                delete K2;
                delete K3;
                delete K4;
            }
            else
            {
                prev=head;
                while(prev->next != K1)
                {
                    prev=prev->next;
                }

                prev->next = walker;
                delete K1;
                delete K2;
                delete K3;
                delete K4;
            }

        }
        else
        {
                K3->next = walker;
                delete K4;
        }

        if(walker==NULL) return;
        K1 = walker;
    }
}