C++Stack应用-表达式计算器

/*@file test.cpp*/
/*mingGW compiled ok*/

#include <iostream>

#include "Stack.h"
#include "calculator.h"
using namespace std;
 
int main()
{
     Calculator C1;
     C1.run();

    return 0;
}

/**************************************************************************/

运行结果如下:

Please input expression: (end by =)
8 5 6 + * 2 / 6 8 * + =
Result: 92

 

/**************************************************************************/

/*@file "Stack.h"*/

#ifndef STACK_H
#define STACK_H

#define SIZE_INIT 100
#define SIZE_INCREMENT 100
template <typename Type> class Stack
{
    public:
       Stack();
        ~Stack();
        int getLength() const { return length; }
        Type getTop();
        bool empty(){ return (top == base); }
        bool full(){ return (length >= size); }
        void push(const Type &val);
        Type pop();
        void makeEmpty();
        void visit();
    private:
        Type *base;
        Type *top;
        int length;
        int size;
};

template <typename Type> Stack<Type>::Stack() : length(0), size(SIZE_INIT)
{
    base = new Type[SIZE_INIT];
    top = base;
}

template <typename Type> Stack<Type>::~Stack()
{
    delete [] base;

}

template <typename Type> Type Stack<Type>::getTop()
{
    if(empty())
    {
        cerr << "Stack empty: getTop()/n";
        exit(-1);
    }

    return *(top-1);
}

template <typename Type> void Stack<Type>::push(const Type &val)
{
    if(full())
    {
        cerr << "Stack full: push()/n";
        exit(-1);
    }

    *top = val;
    top++;
    length++;
}

template <typename Type> Type Stack<Type>::pop()
{
    if(empty())
    {
        cerr << "Stack empty: pop()/n";
        exit(-1);
    }

    Type val = *(top-1);
    top--;
    length--;

    return val;
}

template <typename Type> void Stack<Type>::makeEmpty()
{
    if(empty())
    {
        return;
    }

    while(top != base)
    {
        pop();
    }
   
}


template <typename Type> void Stack<Type>::visit()
{
    if(empty())
    {
        cout << "empty, no element visited/n";
        return;
    }

    Type *ptr = base;

    cout << "[bottom: ";
    while(ptr != top)
    {
        cout << *ptr << " ";
        ptr++;
  }
    cout << ":top]/n";

}

#endif

/**************************************************************************/

/*Calculator.h*/
#ifndef CALCULATOR_H
#define CALCULATOR_H
#include <math.h>
using namespace std;

class Calculator
{
 public:
     Calculator(){ }
     ~Calculator(){ }
 
     void run();
     void clear();
 
 private:
     void addOperand(double val){ iStack.push(val); }
     bool getOperand(double &left, double &right);
     void doOperator(char op);
     Stack<double> iStack; 
 
};


bool Calculator::getOperand(double &left, double &right)
{
     if(iStack.empty())
     {
         cerr << "Missing Operand!" << endl;
         return false;
     }

     right = (double)iStack.pop();
 
     if(iStack.empty())
     {
         cerr << "Missing Operand!" << endl;
         return false;
     }
 
     left = (double)iStack.pop();

     return true;
 }
 
 void Calculator::doOperator(char op)
 {
     double left, right;
     if(getOperand(left, right))
     {
         switch(op)
         {
             case '+': iStack.push(left + right); break;
             case '-': iStack.push(left - right); break;
             case '*': iStack.push(left * right); break;
             case '/': if(right == 0.0)
                       {
                           cerr << "Divide by 0!" << endl;
                           clear();
                       }
                       else
                       {
                           iStack.push(left/right);
                           break;
                       }
             case '^': iStack.push(pow(left, right)); break;
         }
     }
     else clear();
 
 }
 
 void Calculator::run()
 {
     char ch;
     double newop;
     cout << "Please input expression: (end by =)/n";
     while(cin >> ch, ch != '=')
     {
         switch(ch)
         {
             case '+':
             case '-':
             case '*':
             case '/':
             case '^':
                      doOperator(ch); break;
 
             default: cin.putback(ch);
                      cin >> newop;
                      addOperand(newop);
                      break;
         }
     }
 
     cout << "Result: " << (double)iStack.pop() << "/n";
 }
 
 void Calculator::clear()
 {
     iStack.makeEmpty();
 
 }

#endif

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
对于实现逆波兰表达式的简单计算器,可以按照以下步骤进行操作: 1. 创建一个栈来存储操作数。 2. 遍历逆波兰表达式,对于每个元素执行以下步骤: - 如果是数字,将其压入栈中。 - 如果是操作符,从栈中弹出两个操作数进行运算,并将结果再次压入栈中。 3. 最后栈中的唯一元素就是计算结果。 以下是一个简单的C代码示例: ```c #include <stdio.h> #include <stdlib.h> #include <ctype.h> #define MAX_STACK_SIZE 100 // 栈结构定义 typedef struct { int top; int data[MAX_STACK_SIZE]; } Stack; // 初始化栈 void initialize(Stack* s) { s->top = -1; } // 判断栈是否为空 int is_empty(Stack* s) { return s->top == -1; } // 判断栈是否已满 int is_full(Stack* s) { return s->top == MAX_STACK_SIZE - 1; } // 入栈 void push(Stack* s, int value) { if (is_full(s)) { printf("栈已满,无法入栈。\n"); exit(1); } s->data[++s->top] = value; } // 出栈 int pop(Stack* s) { if (is_empty(s)) { printf("栈为空,无法出栈。\n"); exit(1); } return s->data[s->top--]; } // 计算逆波兰表达式 int calculate(char* expression) { Stack s; initialize(&s); int i = 0; while (expression[i] != '\0') { if (isdigit(expression[i])) { push(&s, expression[i] - '0'); } else { int operand1 = pop(&s); int operand2 = pop(&s); switch (expression[i]) { case '+': push(&s, operand1 + operand2); break; case '-': push(&s, operand1 - operand2); break; case '*': push(&s, operand1 * operand2); break; case '/': push(&s, operand1 / operand2); break; default: printf("非法操作符:%c\n", expression[i]); exit(1); } } i++; } int result = pop(&s); if (!is_empty(&s)) { printf("逆波兰表达式不合法。\n"); exit(1); } return result; } int main() { char expression[] = "34+56-*"; int result = calculate(expression); printf("计算结果:%d\n", result); return 0; } ``` 此代码中的逆波兰表达式为"34+56-*",计算结果为14。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值