Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- {
- List *ptr;
- ptr = u;
- while (ptr != NULL) {
- if (DataItem == ptr->a) return true;
- else ptr = ptr->Next;
- }
- return false;
- }
- #include <cstdlib>
- #include <iostream>
- #include <string.h>
- #include <fstream>
- using namespace std;
- struct Data
- { int a;
- };
- struct List
- { Data d;
- List *next;
- };
- int main(int argc, char** argv) {
- List *u = NULL;
- // 1 uzel
- u = new List; // obyavlenie
- u->d.a = 3;
- u->next = NULL; // ukazatel na sled element
- // dlya udobstva sozd peremennuyu-ukazatel kotoraya hranit adress posl elementa
- List *x;
- // 2 uzel
- x = u;
- x->next = new List;
- x = x->next;
- x->d.a = 5;
- x->next = NULL;
- //
- List *c;
- // 3 uzel
- c = x;
- c->next = new List;
- c = c->next;
- c->d.a = 1;
- c->next = NULL;
- //
- List *b;
- // 4 uzel
- b = c;
- b->next = new List;
- b = b->next;
- b->d.a = 9;
- b->next = NULL;
- // Vivod (prosto idem po spisku)
- while(u)
- {
- cout << u->d.a << endl;
- u = u->next;
- }
- // Nahodim max i min znachenie Spiska
- bool Find_Item_Single_List(List* u, int DataItem) {
- List *ptr;
- ptr = u;
- while (ptr != NULL) {
- if (DataItem == ptr->a) return true;
- else ptr = ptr->Next;
- }
- return false;
- }
Add Comment
Please, Sign In to add comment