Bob103

home_t1

Jul 6th, 2016
78
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.50 KB | None | 0 0
  1. #include <iostream>
  2. #include <deque>
  3.  
  4.  
  5. using namespace std;
  6.  
  7. int main()
  8. {
  9. deque <int> d1;
  10.  
  11. int n;
  12. cout << "Enter size:";
  13. cin >> n;
  14.  
  15. for (int i = 0; i < n; i++)
  16. {
  17. int x;
  18. cin >> x;
  19. d1.push_back(x);
  20. }
  21.  
  22. for (int k = 0; k < d1.size()-1; k++ )
  23. {
  24. deque<int>::iterator j = d1.begin();
  25. if (d1[k] == d1[k+1])
  26. {
  27. advance(j, k);
  28. d1.erase(j);
  29. }
  30.  
  31. }
  32.  
  33. for (int k = 0; k < d1.size(); k++)
  34. {
  35. cout << d1[k] << " ";
  36. }
  37.  
  38.  
  39. system("pause");
  40. return 0;
  41. }
Advertisement
Add Comment
Please, Sign In to add comment