Rodex_

Postfix_Calculator

Mar 13th, 2017
312
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 3.12 KB | None | 0 0
  1. ===Headfile===
  2. //
  3. // Created by Alexander Dietrich on 09.03.2017.
  4. //
  5.  
  6. #ifndef POSTFIX_STACK_H
  7. #define POSTFIX_STACK_H
  8.  
  9. #include <iostream>
  10.  
  11. class Node{
  12. public:
  13.     Node* getNext(){
  14.         return next;
  15.     }
  16.     int getValue(){
  17.         return value;
  18.     }
  19.  
  20.     void setNext(Node* nextNext){
  21.         next = nextNext;
  22.     }
  23.     void setValue(int number){
  24.         value = number;
  25.     }
  26.  
  27. private:
  28.     Node *next;
  29.     int value;
  30. };
  31.  
  32.  
  33. class Stack{
  34. public:
  35.     Stack(); //constructor
  36.     ~Stack(); //destructor
  37.  
  38.     void push(int value);
  39.     int pop();
  40.  
  41. private:
  42.     Node *first;
  43. };
  44.  
  45. #endif //POSTFIX_STACK_H
  46.  
  47.  
  48. ======stack.cpp======
  49. //
  50. // Created by Alexander Dietrich on 09.03.2017.
  51. //
  52. #include "stack.h"
  53.  
  54. Stack::Stack() {
  55.     // stack wird auf auf null gesetzt
  56.     first = nullptr;
  57. }
  58.  
  59. Stack::~Stack() {
  60.     // destructor -> stack wird wieder gelöscht (allocated mem freigegeben)
  61.     Node* current = first;
  62.     while(current != nullptr){
  63.         Node* tempNext = current->getNext();
  64.         delete current;
  65.         current = tempNext;
  66.     }
  67. }
  68.  
  69. void Stack::push(int value) {
  70.     // nächste Eingabe wird auf den Stack gelagert
  71.     if(first == nullptr){
  72.         first = new Node();
  73.         first->setValue(value);
  74.         first->setNext(nullptr);
  75.     }else{
  76.         Node *tmp = new Node();
  77.         tmp->setNext(first);
  78.         tmp->setValue(value);
  79.         first = tmp;
  80.     }
  81. }
  82.  
  83. int Stack::pop() {
  84.     // die zuletzt eingegebene Zahl wir zurückgegeben vom Stack
  85.     int toReturn = first->getValue();
  86.     Node *next = first->getNext();
  87.  
  88.     delete first;
  89.  
  90.     first = next;
  91.  
  92.     return toReturn;
  93. }
  94.  
  95. ==============main.c==============
  96. #include <iostream>
  97. #include <sstream>
  98. #include <cstdio>
  99. #include <cstdlib>
  100. #include "stack.h"
  101.  
  102. using namespace std;
  103.  
  104. int main() {
  105.     int number1 = 0, number2 = 0, end = 1;
  106.  
  107.     Stack* liste = new Stack();
  108.  
  109.  
  110.     while(end == 1) {
  111.         std::string eingabe = "";
  112.         std::cin >> eingabe;
  113.  
  114.  
  115.         if (eingabe.compare("-") == 0) {
  116.             number2 = liste->pop();
  117.             number1 = liste->pop();
  118.             liste->push(number1 - number2);
  119.         } else if (eingabe.compare("+") == 0) {
  120.             number2 = liste->pop();
  121.             number1 = liste->pop();
  122.             liste->push(number1 + number2);
  123.         } else if (eingabe.compare("/") == 0) {
  124.             number2 = liste->pop();
  125.             number1 = liste->pop();
  126.             liste->push(number1 / number2);
  127.         } else if (eingabe.compare("%") == 0) {
  128.             number2 = liste->pop();
  129.             number1 = liste->pop();
  130.             liste->push(number1 % number2);
  131.         } else if (eingabe.compare("*") == 0) {
  132.             number2 = liste->pop();
  133.             number1 = liste->pop();
  134.             liste->push(number1 * number2);
  135.         } else if (eingabe.compare("=") == 0) {
  136.             number1 = liste->pop();
  137.             cout << number1 << endl;
  138.             end = 0;
  139.         } else {
  140.             std::stringstream s(eingabe);
  141.             s >> number1;
  142.             liste->push(number1);
  143.         }
  144.     }
  145.  
  146.     delete liste;
  147.     return 0;
  148. }
Advertisement
Add Comment
Please, Sign In to add comment