Advertisement
Guest User

Untitled

a guest
Oct 13th, 2015
84
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.02 KB | None | 0 0
  1. #include <iostream>
  2. #include "Stack.h"
  3. using namespace std;
  4. #define MAXSTACK 50
  5. int nHead = 0; // stos jest początkowo pusty
  6. char Stack[MAXSTACK] = { 0 };
  7. // =========================================
  8. void push(char c)
  9. {
  10. if (nHead < MAXSTACK)
  11. {
  12. Stack[nHead] = c;
  13. nHead++;
  14. }
  15. else
  16. cout << "BLAD!! Stos jest pelny!!\n";
  17. }
  18.  
  19. // =========================================
  20. char pop()
  21. {
  22. char c = top();
  23. if (c)
  24. {
  25. del();
  26. }
  27. else
  28. cout << "BLAD!! Stos jest pusty!!\n";
  29. return c;
  30. }
  31.  
  32. // =========================================
  33. char top()
  34. {
  35. if (IsEmpty() == 1)
  36. {
  37.  
  38. cout << " ERROR! Stos jest pusty!! \n";
  39. return 0;
  40. }
  41. else
  42. {
  43.  
  44. return Stack[nHead];
  45. nHead--;
  46. }
  47. }
  48.  
  49. // =========================================
  50. void del()
  51. {
  52. if ( IsEmpty() == 1 )
  53. {
  54. cout << " ERROR! Stos jest pusty!! \n";
  55. }
  56. else
  57. {
  58. Stack[nHead] = NULL;
  59. nHead--;
  60. }
  61.  
  62. }
  63.  
  64. // =========================================
  65. int IsEmpty()
  66. {
  67. if (nHead == 0) return 1;
  68. else return 0;
  69. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement