Ma'lumot tuzilmalari (Data Structures) - Stack
👇👇👇👇👇👇
@uz_python

Ma'lumot tuzilmalari (Data Structures) - Queue
👇👇👇👇👇👇
@uz_python

Ma'lumot tuzilmalari (Data Structures) - Tree
👇👇👇👇👇👇
@uz_python

Ma'lumot tuzilmalari (Data Structures) - Binary Tree

👇👇👇👇👇👇
@uz_python

Malumotlar Tuzilmasidan siz uchun kerakli bo'lgan videokurslar

@uz_python 💯💯💯

Ma'lumot tuzilmalari (Data Structures) - Kirish

https://t.iss.one/uz_python/191

Ma'lumot tuzilmalari (Data Structures) - List va Array haqida

https://t.iss.one/uz_python/193

Ma'lumot tuzilmalari (Data Structures) - Bog'langan ro'yhat (Linked List)

https://t.iss.one/uz_python/194

Ma'lumot tuzilmalari (Data Structures) - Stack

https://t.iss.one/uz_python/195

Ma'lumot tuzilmalari (Data Structures) - Queue

https://t.iss.one/uz_python/196

Ma'lumot tuzilmalari (Data Structures) - Tree

https://t.iss.one/uz_python/197

Ma'lumot tuzilmalari (Data Structures) - Binary Tree

https://t.iss.one/uz_python/198

@BekorchiStudentlar

Bitta dasturiy maxsulot davlatimizga qancha naf keltiradi, korrupsiya, byurokratiyani bartaraf etadi, Odamlarga qulaylik yaratadi.
Xar doyim yodda tutingki sizlarni ishingiz judayam muxim.
Credid: #ustoz_shogird
@uz_python

2 ta ro’yhatning bir xil qiymatli elementlaridan yangi halqasimon ro’yhat yarating

#include <iostream>
using namespace std;
class Node{
public: int number;
Node* next;
};
int main()
{ Node* head = NULL;
Node* lastPtr = NULL;
short action = -1;
while (1)
{ cout<<"1. 1- guruh raqam berish\n";
cout<<"2 2-guruh raqam berish:\n";
cout<<"3. ro'yhatni ko'rish\n";
cout<<"4 ro'yxatni korish\n";
cout<<" qushish\n";
cout<<"0. chiqish\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 == 3){
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<<ptr->number<<" ";
if (ptr->next == 0) break;

ptr = ptr->next;
}
cout<<"\n\n";
system("PAUSE");
//system("CLS");
continue;
}

if (action == 2)
{ //system("CLS");
Node* ken = new Node;
int numb = -1;

cout<<"son kiriting: ";
cin>>numb;
ken->number = numb;
ken->next = NULL;
if (head == 0)
{ head = ken;
lastPtr = ken;
// system("CLS");
continue;
}
lastPtr->next = ken;
lastPtr = ken;
system("CLS");
continue;
}
if (action == 4){
Node* ken = NULL;
//system("CLS");
if (head == 0)
{ cout<<"\t!!! ro'yhat bo'sh !!!\n\n";
system("PAUSE");
system("CLS");
continue;
}
cout<<"* * * * * ro'yhat * * * * *\n\n";
ken = head;
while (1) {
cout<<ken->number<<" ";
if (ken->next == 0) break;

ken = ken->next;
}
cout<<"\n\n";
system("PAUSE");
//system("CLS");
continue;
}
if(action==5)
{
Node* qush = NULL;
system("CLS");

if (head == 0)
{ cout<<"\t!!! ro'yhatlar bo'sh !!!\n\n";
continue;
}
ken = head;
while (1) {
cout<<ken->number<<" ";
if (ken->next == 0) break;

if(ken ==prt)
{
Node* qush = new Node;
int numb = -1;

qush->number = numb;
qush->next = NULL;
if (head == 0)
{ head = qush;
lastPtr = qush;
continue;
}
lastPtr->next = qush;
lastPtr = qush;
continue;
}
}
cout<<"\n";
continue;

}
}
}

Ro'yhat Kiritilgan sonlarningn har 3chisini o`chiruvchi dastur tuzing.

Dastur kodi:
#include <bits/stdc++.h>
using namespace std;
int main() {
list <int> num_list;
int n,k;
cout<<"Nechta son kiritasiz: ";
cin>>n;
for(int i=0;i<n;i++)
{ cin>>k;num_list.push_back(k); }
size_t size = num_list.size();
cout<<"natija: ";
list <int> :: iterator it = num_list.begin();
while(size--)
{ auto toDelete = it; it++;
if (size%3==1) num_list.erase(toDelete); }
for(it = num_list.begin();
it != num_list.end(); ++it)
{ cout << *it << " "; }
cout << endl; return 0; }
Dastur natijasi:

Nechta son kiritasiz: 10
1 2 3 4 5 6 7 8 9 10
natija: 1 2 4 5 7 8 10

/* 2ta nxn matitsani ko'paytirish */
#include<iostream>
#include<vector>
using namespace std;
int a[10][10],b[10][10],H[10][10];
int main(){

int n; cout<<"n: "; cin>>n;
cout<<"a["<<n<<"]["<<n<<"] : \n";
for (int i = 0; i < n; i++){
for (int j = 0; j< n; j++){
cin>>a[i][j];
}}
cout<<"b["<<n<<"]["<<n<<"] : \n";
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
cin>>b[i][j];
}}



for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
// H[i][j] = 0;
for (int t = 0; t < n; t++){
H[i][j] += a[i][t] * b[t][j];

}
}
}
cout<<"a["<<n<<"]["<<n<<"]xb["<<n<<"]["<<n<<"] :\n";
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
cout<< H[i][j]<<" " ;
}cout<<endl;
}



}

/*
15-masala. Lotoreya ishtirokchilari familiyalari va mukofotlar nomlaridan tashkil topgan 2 ta halqasimon ro’yhat berilgan. N ta ishtirokchi g’olib bo’lsin (har K-inchi). Mukofotlarni qayta hisoblash soni - t.
*/
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int number;
string ismi;
Node* next;
};
int n;
struct Node* head = NULL;
struct Node* lastPtr = NULL;
void qushish()
{
Node* ptr = new Node;
int numb = -1; string a;
cout<<"o'yinchi raqamini kiriting: ";
cin>>numb;
cout<<" ismini kiriting: ";
cin>>a;
ptr->number = numb;
ptr->ismi = a;
ptr->next = NULL;
if (head == 0)
{
head = ptr;
lastPtr = ptr;
}
lastPtr->next = ptr;
lastPtr = ptr;
}
void chop_etish()
{
Node* ptr = NULL;
if (head == 0)
{
cout<<"\t!!! ro’yhat bo’sh !!!\n\n";
}
cout<<"* * * * * ro’yhat * * * * *\n\n";

ptr = head;
while (1)
{
cout<<ptr->number<<" ";
cout<<ptr->ismi<<" \n";
if (ptr->next == 0) break;
ptr = ptr->next;}
cout<<"\n\n";}
void golib(){
Node* p1 = head;
Node* q1 = new Node;
int k=rand()%(n-1)+1;
for (int i=0;i<k-1;i++) p1=p1->next;
q1 = p1->next;
p1->next = q1->next;
cout<<" go'lib o'yinchi!:\n";
cout<<q1->number<<" ";
cout<<q1->ismi;"\n\n";
}
int main()
{
cout<<" Ro'yhat elementlari sonini kiriting:\n";
cin>>n;
cout<<" Ro'yhat elementlarini kiriting:\n";
for(int i=0;i<n;i++)
{
qushish();
}
chop_etish();
golib();
}

/*
Mahsulot nomlaridan tashkil topgan ro’yhat berilgan. Ro’yhat elementlaridagi SONY firmasida ishlab chiqilgan mahsulotlardan tashkil topgan yangi ro’yhat yarating.

Algoritmi:
ContainsWord nomli mantiqiy funksiya yaratish;
Undan faqat true yoki false qiymat qaytaradi.
Royhat yaratish;
Royhatga malumot kiritish;
Sony sozini malumotda qatnashganligini tekshirish;
Sony sozi qatnashgan malumotlarni chiqarish.
*/
Dasturiy korinishi:
#include "iostream"
#include "string"
#include "list"
using namespace std;
bool containsWord(string word, string inLine) {
int wlen, counter = 0, slength = inLine.length() - word.length() + 1;
wlen = word.length();

for(int i = 0; i < slength; i++) {
for(int j = 0; j < word.length(); j++){
if(word[j] == inLine[i + j])
counter++;
else{
counter = 0;
break;
}
}

if(counter == wlen) {
return true;
}
counter = 0;
}
return false;
}
main()
{
list<string> brands;
brands.push_front("Televizor-Artel");
brands.push_front("Changyutgich-Roison");
brands.push_front("Telefon-Sony");
brands.push_front("Notebook-Asus");
brands.push_front("Konditsioner-Sony");
brands.push_front("Playstation-Sony");
brands.push_front("Muzlatgich-Artel");
brands.push_front("Blender-Artel");
brands.push_front("Televizor-Sony");
brands.push_front("Notebook-Acer");

string current, brand = "Sony";
list<string> sonyBrands, bCopy = brands;

for(int i = 0; i < brands.size(); i++) {
current = bCopy.front();
if(containsWord(brand, current)) {
sonyBrands.push_front(bCopy.front());
}
bCopy.pop_front();
}

list<string> copy = sonyBrands;
cout << endl << "Sony brendi ostidagi tovarlar:" << endl << endl;
for(int i = 0; i < sonyBrands.size(); i++) {
cout << copy.front() << endl;
copy.pop_front();
}

/*

4-Variant.

Royhat yarating, Royhatga N ta haqiqiy son kiriting. Royhatning minimum elementini ochirich dasturini tuzing.

Dastur Kodi:

*/
#include <iostream>
using namespace std;

class Node{

public:

int number;

Node* next;

};

int main()
{ int n;
cout<<"Ro'yhat Elementlari sonini kiriting: \n\n";
cin>>n;
Node* head = NULL;
Node* lastPtr = NULL;
cout<<"\nRo'yhat Elementlarini kiriting: \n\n";
for(int i=0;i<n;i++){

{
Node* ptr = new Node;
int numb = -1;
cin>>numb;
ptr->number = numb;
ptr->next = NULL;
if (head == 0)
{ head = ptr;
lastPtr = ptr;

continue;
}
lastPtr->next = ptr;
lastPtr = ptr;

continue; } }
{
Node* ptr = NULL;

if (head == 0)
{
cout<<"\t!!! Ro'yhat bosh !!!\n\n";
system("PAUSE");

}
cout<<"\nRo'yhat minimal elementlari o'chirildi!: \n\n";
ptr = head;
int min=ptr->number;
Node* q = new Node;
while(ptr){
if(min>ptr->number){ min=ptr->number;}
ptr=ptr->next; }
ptr = head;
while (1) {
if(min==ptr->number) {
delete(ptr);}
else cout<<ptr->number<<" ";
if (ptr->next == 0) break;
ptr = ptr->next; }

cout<<"\n\n";
system("PAUSE"); } }