Advertisement
Guest User

Untitled

a guest
Mar 19th, 2019
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.52 KB | None | 0 0
  1. #include "pch.h"
  2. #include <iostream>
  3. using namespace std;
  4.  
  5. struct Stack {
  6. int inf;
  7. Stack *Next, *Head;
  8. };
  9. void push(int inf, Stack *StackPointer)
  10. {
  11. Stack *temp = new Stack;
  12. temp->inf = inf;
  13. temp->Next = StackPointer->Head;
  14. StackPointer->Head = temp;
  15. }
  16.  
  17. void Show(Stack *StackPointer)
  18. {
  19. Stack *temp = StackPointer->Head;
  20. while (temp != NULL)
  21. {
  22. cout << temp->inf << " ";
  23. temp = temp->Next;
  24. }
  25. }
  26.  
  27.  
  28.  
  29.  
  30.  
  31. int MaxValue(int pos,Stack *StackPointer)
  32. {
  33. Stack *temp = StackPointer->Head;
  34. int max = StackPointer->Head->inf;
  35. while (temp != NULL)
  36. {
  37. pos++;
  38. if (temp->inf > max)
  39. {
  40. max = temp->inf;
  41. int pos = 0;
  42. }
  43. temp = temp->Next;
  44. }
  45. cout << max;
  46. return pos;
  47. }
  48.  
  49.  
  50.  
  51. void pop(Stack *StackPointer)
  52. {
  53. while (StackPointer->Head != NULL)
  54. {
  55. Stack *temp = StackPointer->Head->Next;
  56. delete StackPointer->Head;
  57. StackPointer->Head = temp;
  58. }
  59. }
  60.  
  61. int main()
  62. {
  63. setlocale(LC_ALL, "Russian");
  64. int n, elem,p;
  65. cout << "Введите размер стека: ";
  66. cin >> n;
  67. Stack *NewStack = new Stack;
  68. Stack *StackPointer = new Stack;
  69. StackPointer->Head = NULL;
  70. NewStack->Head = NULL;
  71. for (int i = 0; i < n; i++)
  72. {
  73. cout << "Введите элемент стека: ";
  74. cin >> elem;
  75. push(elem, StackPointer);
  76.  
  77. }
  78. Show(StackPointer);
  79.  
  80. cout << endl;
  81. cout << "максимзн = " << MaxValue(n,StackPointer) << endl;
  82.  
  83. Show(NewStack);
  84. pop(StackPointer);
  85. pop(NewStack);
  86. delete NewStack->Head;
  87. delete NewStack;
  88. delete StackPointer->Head;
  89. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement