Untitled

SUBMITTED BY: becausemon01

DATE: June 26, 2017, 2:09 p.m.

FORMAT: Text only

SIZE: 1.3 kB

Raw Download

HITS: 707

Report
  1. #include <iostream>
  3. using namespace std;
  5. struct Node
  6. {
  7. int data;
  8. Node* pNext;
  9. };
  11. struct list
  12. {
  13. Node* pHead;
  14. Node* pTail;
  15. };
  17. void khoaitao(list& l)
  18. {
  19. l.pHead=NULL;
  20. l.pTail=NULL;
  21. }
  22. Node* getNode(int x)
  23. {
  24. Node* p= new Node;
  25. if(p==NULL)
  26. return NULL;
  27. else {
  28. p->data=x;
  29. p->pNext=NULL;
  30. }
  31. }
  33. void addHead(list &l, Node* p)
  34. {
  35. if(l.pHead==NULL)
  36. l.pHead=l.pTail=p;
  37. else {
  38. p->pNext=l.pHead;
  39. l.pHead=p;
  40. }
  41. }
  43. void addTail(list &l, Node* p)
  44. {
  45. if(l.pHead==NULL)
  46. l.pHead=l.pTail=p;
  47. else {
  48. l.pTail->pNext=p;
  49. l.pTail=p;
  50. }
  51. }
  53. void addAfter(list &l, int x, int y)
  54. {
  55. Node* p;
  56. for(p=l.pHead;p!=NULL;p->pNext)
  57. {
  58. if(p->data==x)
  59. {
  60. Node* t=getNode(y);
  61. p->pNext=t->pNext;
  62. p->pNext=t;
  63. t->data=y;
  64. break;
  65. }
  66. else addHead(l,p);
  67. }
  68. }
  69. void xuat(list l)
  70. {
  71. for(Node* p=l.pHead;p!=NULL;p=p->pNext)
  72. {
  73. cout<<p->data;
  74. }
  75. }
  77. int main()
  78. {
  79. list l;
  80. khoaitao(l);
  81. int x;
  82. do{
  83. cin>>x;
  84. if(x==3)
  85. break;
  86. else if(x==0)
  87. {
  88. int a;
  89. cin>>a;
  90. Node* p;
  91. addHead(l, p =getNode(a));
  92. }
  93. else if(x==1)
  94. {
  95. int b;
  96. cin>>b;
  97. Node* p;
  98. addTail(l,p=getNode(b));
  99. }
  100. else if(x==2)
  101. {
  102. int c,d;
  103. cin>>c;
  104. cin>>d;
  105. addAfter(l,c,d);
  106. }
  107. }while(x!=3);
  108. xuat(l);
  109. return 0;
  110. }
comments powered by Disqus