fork download
copy 
  1. #include<iostream>
  2. using namespace std;
  3. typedef int type;
  4. struct node
  5. {
  6. 	type data;
  7. 	node* past;
  8. 	node* next;
  9. };
  10. typedef node* position;
  11. class doublelinkedlist {
  12. 	node* head;
  13. 	node* tail;
  14. 	int count;
  15. public:
  16. 	void makenull()
  17. 	{
  18. 		head = new node;
  19.  
  20. 		tail = head= NULL;
  21. 		count = 0;
  22. 	}
  23. 	doublelinkedlist()
  24. 	{
  25. 		makenull();
  26. 	}
  27.  
  28. 	int getLength()
  29. 	{
  30. 		return count;
  31. 	}
  32.  
  33. 	position first()
  34. 	{
  35. 		return head;
  36. 	}
  37.  
  38. 	position end() {
  39. 		return tail;
  40. 	}
  41. 	position locate(type value)
  42. 	{
  43. 		node* temp = head;
  44. 		int i = 0;
  45. 		while (temp->next!=NULL&&temp!=NULL)
  46. 		{
  47. 			if (temp->next->data == value)
  48. 			{
  49. 				cout <<"node number" << i +1<< "this position exist in previous node this =" << endl;
  50. 				return temp;
  51. 			}
  52. 			i++;
  53. 			temp = temp->next;
  54. 		}
  55. 		return NULL;
  56. 	}
  57.  
  58.  
  59. 	position previous(position item)
  60. 	{
  61. 		if (item == NULL ||item == head)
  62. 		{
  63. 			cout << "out range";
  64. 			return NULL;
  65. 		}
  66. 		else
  67. 		return (item->past);
  68. 	}
  69. 	position next(position item)
  70. 	{
  71. 		if (item == NULL || item->next == NULL)//item==tail
  72. 		{
  73. 			cout << "out range";
  74. 			return NULL;
  75. 		}
  76.  
  77. 		else
  78. 		return item->next;
  79. 	}
  80.  
  81.  
  82. 	void additem(position item, type value) {
  83. 		position temp = new node;
  84. 		temp->data = value;
  85. 		temp->next = temp->past = NULL;
  86.  
  87. 		if (head == NULL) 
  88. 			head = tail = temp;
  89.  
  90. 		else if (item == NULL) {  
  91. 			cout << "Item does not exist!" << endl;
  92. 			return;
  93. 		}
  94. 		else if (item == tail) {  
  95. 			tail->next = temp;
  96. 			temp->past = tail;
  97. 			tail = temp;
  98. 		}
  99. 		else {  
  100. 			temp->next = item->next;
  101. 			temp->past = item;
  102. 			item->next->past = temp;
  103. 			item->next = temp;
  104. 		}
  105.  
  106. 		count++;
  107. 	}
  108.  
  109. 	type retirve(position item) {
  110. 		if (item == NULL) {
  111. 			cout << "Item unavailable" << endl;
  112. 			return -1;
  113. 		}
  114. 		return item->data;
  115. 	}
  116.  
  117. 	void deleted(position item) {
  118. 		if (item == NULL) {
  119. 			cout << "Item unavailable" << endl;
  120. 			return;
  121. 		}
  122. 		else if (item == head) { 
  123. 			head = head->next;
  124. 			head->past = NULL;
  125. 		}
  126. 		else if (item == tail) {  
  127. 			tail = tail->past;
  128. 			tail->next = NULL;
  129. 		}
  130. 		else {  
  131. 			item->past->next = item->next;
  132. 			item->next->past = item->past;
  133. 		}
  134.  
  135. 		delete item;
  136. 		count--;
  137. 	}
  138.  
  139. 	void print()
  140. 	{
  141. 		position temp = head;
  142. 		while (temp != NULL) {
  143. 			cout << temp->data << " <-> ";
  144. 			temp = temp->next;
  145. 		}
  146. 		cout << "NULL" << endl;
  147. 	}
  148.  
  149. };
  150.  
  151.  
  152.  
  153.  
  154. typedef doublelinkedlist dll;
  155. void purge(dll  &l1)//مبتحذفش اول عنصر
  156. {
  157. 	position temp =l1.first();
  158. 	position temp2 , nexttemp2;
  159. 		while (temp!=NULL)
  160. 		{
  161. 			temp2 =l1.next(temp);
  162. 			while(temp2 != NULL)
  163. 			{
  164. 				nexttemp2 = l1.next(temp2);
  165. 				if (temp->data == temp2->data)
  166. 				{
  167.  
  168. 					l1.deleted(temp2);
  169.  
  170. 				}
  171. 				temp2 = nexttemp2;
  172. 			}
  173. 			temp = l1.next(temp);
  174. 		}
  175. 		cout << "after purge" << endl;
  176. 		l1.print();
  177.  
  178. }
  179.  
  180. void reserved(dll& l1)
  181. {
  182.  
  183. 	dll l2;
  184. 	position temp = l1.end();
  185. 	type value;
  186. 	while (temp !=NULL)
  187. 	{
  188. 		value = l1.retirve(temp);
  189. 		l2.additem(l2.end(), value);// temp->data); 
  190.  
  191. 		temp = l1.previous(temp);
  192.  
  193. 	}
  194. 	cout << "\nbefore reserve" << endl;
  195. 	l1.print();
  196. 	l1 = l2;
  197. 	cout << "\nafter reserve" << endl;
  198. 	l1.print();
  199. }
  200.  
  201.  
  202.  
  203.  
  204. int main()
  205. {
  206. 	doublelinkedlist l1;
  207. 	l1.additem(l1.first(), 40);
  208. 	l1.additem(l1.first(), 30);
  209. 	l1.additem(l1.first(), 10);
  210. 	l1.additem(l1.first(), 20);
  211. 	l1.additem(l1.first(), 30);
  212. 	l1.additem(l1.first(), 20);
  213. 	l1.additem(l1.first(), 15);
  214. 	l1.additem(l1.end(), 42);
  215. 	l1.additem(l1.end(), 50);
  216. 	l1.additem(l1.end(), 50);
  217. 	l1.additem(l1.end(), 65);
  218. 	l1.additem(l1.end(), 40);
  219. 	l1.additem(l1.end(), 50);
  220. 	l1.print();
  221. 	reserved(l1);
  222. 	//l1.deleted(l1.first());
  223.  
  224. 	purge(l1);
  225. 	l1.print();
  226. 	cout << endl;
  227. 	//reserved(l1);
  228. 	purge(l1);
  229. 	cout<<l1.locate(30)->data << endl;
  230. 	cout << l1.retirve(l1.first()) << endl;
  231. 	cout << l1.retirve(l1.end())<< endl;  
  232. 	//cout << l1.next(l1.end())->data<<endl;	//  error
  233. 	//cout << l1.previous(l1.first())->data;	 //  error
  234. 	cout << l1.next(l1.first())->data << endl;
  235. 	cout << l1.previous(l1.end())->data;
  236.  
  237. 	l1.print();
  238. 	l1.deleted(l1.first());
  239. 	l1.print();
  240. 	l1.deleted(l1.end());
  241. 	l1.print();
  242. 	cout << "hallo";
  243. 	return 0;
  244. }
  245.  
Success #stdin #stdout 0s 5292KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
40 <-> 15 <-> 20 <-> 30 <-> 20 <-> 10 <-> 30 <-> 42 <-> 50 <-> 50 <-> 65 <-> 40 <-> 50 <-> NULL
out range
before reserve
40 <-> 15 <-> 20 <-> 30 <-> 20 <-> 10 <-> 30 <-> 42 <-> 50 <-> 50 <-> 65 <-> 40 <-> 50 <-> NULL

after reserve
50 <-> 40 <-> 65 <-> 50 <-> 50 <-> 42 <-> 30 <-> 10 <-> 20 <-> 30 <-> 20 <-> 15 <-> 40 <-> NULL
out rangeout rangeout rangeout rangeout rangeout rangeout rangeout rangeout rangeafter purge
50 <-> 40 <-> 65 <-> 42 <-> 30 <-> 10 <-> 20 <-> 15 <-> NULL
50 <-> 40 <-> 65 <-> 42 <-> 30 <-> 10 <-> 20 <-> 15 <-> NULL

out rangeout rangeout rangeout rangeout rangeout rangeout rangeout rangeout rangeafter purge
50 <-> 40 <-> 65 <-> 42 <-> 30 <-> 10 <-> 20 <-> 15 <-> NULL
node number4this position exist in previous node this =
42
50
15
40
2050 <-> 40 <-> 65 <-> 42 <-> 30 <-> 10 <-> 20 <-> 15 <-> NULL
40 <-> 65 <-> 42 <-> 30 <-> 10 <-> 20 <-> 15 <-> NULL
40 <-> 65 <-> 42 <-> 30 <-> 10 <-> 20 <-> NULL
hallo
https://ideone.com/Q4a8oO
language:
C++14 (gcc 8.3)
created:
11 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!