5-labaratoriya ish Bajardi: Karimov I. Tekshirdi: Bo’riev. Y toshkent – 2021

Dasturiy yechim

9.Ro’yxatni oxirgii elementga teng barcha elementlar o‘chirilsin.

#include

#include

using namespace std;

class Node

{ public:

int data;

Node* next;};

Node* push(Node* head, int new_data)

{ Node* new_node = new Node();

new_node->data = new_data;

new_node->next = head;

head = new_node;

return head;}

Node* deleteKey(Node *head,int x)

{ Node *tmp = head;

while (head->data == x)

{ head = head->next; }

while (tmp->next != NULL)

{ if (tmp->next->data == x) tmp->next = tmp->next->next;

}else { tmp = tmp->next; }}

return head;}void printList(Node* node){

while (node->next !=0)

{ cout << node->data << " ";

node = node->next; } cout << node->data;}

int main()

{ int n;

coot<<"<>\n"; cin>>n;

int a[n];

cout<<"<>\n";

for (int i=0; i

{cin>>a[i]; }

Node* head = NULL;

for (int i=0;i

{ head = push(head, a[i]); }

int key ;

cout<<"kalit=";cin>>key;

cout << "<> \n ";

printList(head);

head = deleteKey(head, key);

cout << "\n<>\n";

printList(head);

return 0;}

Algoritm

1.n ta elementga ega masiv xosil qilamiz

2.Masivni elementlar bilan to’ldiramiz for loop op orqali.

3.Masivni harbir elementini list konteneriga o’zlashtirish orqali listni xosil qilamiz n ta elementli.

4.Ikkita funksia xosil qilamiz.

5.Birinchi funksia delete key Deb nomlaymiz ya’niy kalitga teng elementini o’chirish funksiasi

6.Ikkinchi funksia ekranga chiqarish funksiasi ya’niy kalitga teng element o’chirilgandan so’ng natijani Elon qiladi dastlab o’chirilgandan oldingi keyin o’chirilgandan keyingi natija.

7.Asosiy main funksiasida key degan Butun tipli o’zgaruvchi yaratamiz.va unga qiymat beramiz ochirmoqchi bo’lgan elementini key={a[0]….a[n]} ga kiritishimiz mumkin aks xolda o'chirilmaydi

Va natijani ekranga chiqaramiz