Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<string>
- using namespace std;
- class cnode
- {
- public:
- int info;
- cnode *pnext;
- };
- class clist
- {
- public:
- cnode *phead=NULL;
- cnode *ptail;
- clist()
- {
- phead = NULL;
- ptail = NULL;
- }
- ~clist()
- {
- cnode *ptrav = phead;
- while (ptrav != NULL)
- {
- phead = phead->pnext;
- delete ptrav;
- ptrav = phead;
- }
- }
- void Attach(cnode *pnn)
- {
- if (phead == NULL)
- {
- phead = pnn;
- ptail = pnn;
- }
- else
- {
- ptail->pnext = pnn;
- ptail = pnn;
- }
- }
- /*void sortAttach(cnode *pnn)
- {
- cnode *pB = NULL;
- if (phead == NULL)
- {
- phead=pnn;
- }
- else
- {
- cnode *ptrav = phead;
- while (ptrav != NULL)
- {
- if (ptrav->info < pnn->info)
- {
- break;
- }
- pB = ptrav;
- ptrav = ptrav->pnext;
- }
- if (ptrav != NULL)
- {
- if (pB != NULL)
- {
- pB->pnext = pnn;
- pnn->pnext = ptrav;
- }
- else
- {
- pnn->pnext = ptrav;
- phead = pnn;
- }
- }
- else
- {
- pB->pnext = pnn;
- pnn->pnext = NULL;
- }
- }
- }*/
- };
- int main()
- {
- clist l[30];
- cnode *pnn, *sahm;
- int n;
- for (int i = 0; i < 3; i++)
- {
- cout << "enter size"<<endl;
- cin >> n;
- sahm = l[i].phead;
- cout << "enter info" << endl;
- for (int j = 0; j < n; j++)
- {
- pnn = new cnode;
- cin>>pnn->info;
- pnn->pnext = NULL;
- l[i].Attach(pnn);
- }
- }
- for (int i = 0; i < 3; i++)
- {
- cout << "list" << i<<":"<<endl;
- sahm = l[i].phead;
- while(sahm!=NULL)
- {
- cout << sahm->info << ", ";
- sahm = sahm->pnext;
- }
- cout << endl;
- }
- /////////////////////////////////
- system("pause");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement