19. List yarating, List n ta haqiqiy son kiriting. Listning minimum elementini o’chirich dasturini tuzing



Yüklə 17,77 Kb.
tarix25.12.2023
ölçüsü17,77 Kb.
#161087

19.List yarating, List N ta haqiqiy son kiriting. Listning minimum elementini o’chirich dasturini tuzing.
#include
using namespace std;
class Node{
public: int number;
Node* next;
};
int main()
{ Node* head = NULL;
Node* lastPtr = NULL;
short action = -1;
while (1)
{ cout<<"\n1. element qushish\n";
cout<<"2. Ro'yhatni ko'rish\n";
cout<<"3. minimal elemantni o'chirish\n";
cout<<"0. chiqish\n\n";
cout<<"tanlang: ";
cin>>action;
if (action == 0) {
system("CLS");
break;}
if (action == 1)
{ system("CLS");
Node* ptr = new Node;
int numb = -1;

cout<<"son kiriting: ";


cin>>numb;
ptr->number = numb;
ptr->next = NULL;
if (head == 0)
{ head = ptr;
lastPtr = ptr;
system("CLS");
continue;
}
lastPtr->next = ptr;
lastPtr = ptr;
system("CLS");
continue;
}
if (action == 2){
Node* ptr = NULL;
system("CLS");
if (head == 0)
{ cout<<"\t!!! ro’yhat bo’sh !!!\n\n";
system("PAUSE");
system("CLS");
continue;
}
cout<<"* * * * * ro’yhat * * * * *\n\n";
ptr = head;
while (1) {
cout<
number<<" ";
if (ptr->next == 0) break;
ptr = ptr->next;
}
cout<<"\n\n";
system("PAUSE");
system("CLS");
continue;
}
if (action == 3)
{
system("CLS");
Node* p = head;
Node* q = new Node;
Node* last = new Node;
int min=p->number; q=head;
while(p){
if(min>p->number)
{
min=p->number;
}
p=p->next;
}
cout<<"min:"<p = head;
while(p){
if(p->number != min)
{
cout<
number<<" ";
}
p=p->next;
}
system("CLS");
system("pause");
continue;
}
}}



#include
#include
#include // minimal qiymatni aniqlash uchun
using namespace std;

int main() {


int N;
cout << "N ni kiriting: ";
cin >> N;

list numbers; // haqiqiy sonlar ro‘yhati

cout << N << " ta haqiqiy sonlarni kiriting: " << endl;
for (int i = 0; i < N; i++) {
float number;
cin >> number;
numbers.push_back(number); // ro‘yhatga qo‘shish
}

// Ro‘yxatning avvalgi holatini chiqarish


cout << "Ro‘yxat avval: ";
for (float num : numbers) {
cout << num << " ";
}
cout << endl;

// Minimum elementni topish


float minElement = numeric_limits::max(); // eng katta qiymat
for (float num : numbers) {
if (num < minElement) {
minElement = num; // minimumni yangilash
}
}

// Eng kichik elementni o‘chirib tashlash


numbers.remove(minElement);

// Ro‘yxatning yangi holatini chiqarish


cout << "Ro‘yxat keyin: ";
for (float num : numbers) {
cout << num << " ";
}
cout << endl;

return 0;


}

Yüklə 17,77 Kb.

Dostları ilə paylaş:




Verilənlər bazası müəlliflik hüququ ilə müdafiə olunur ©www.genderi.org 2024
rəhbərliyinə müraciət

    Ana səhifə