224. 基本计算器

class Solution {

public:

    int calculate(string s) {

        static const int STATE_BEGIN = 0;

        static const int NUMBER_STATE = 1;

        static const int OPERATION_STATE = 2;

        std::stack<int> number_stack;

        std::stack<char> operation_stack;

        long number = 0;

        int STATE = STATE_BEGIN;

        int compuate_flag = 0;

        for (int i = 0; i < s.length(); i++){

            if (s[i] == ' '){

                continue;

            }

            switch(STATE){

            case STATE_BEGIN:

                if (s[i] >= '0' && s[i] <= '9'){

                    STATE = NUMBER_STATE;

                }

                else{

                    STATE = OPERATION_STATE;

                }

                i--;

                break;

            case NUMBER_STATE:

                if (s[i] >= '0' && s[i] <= '9'){

                    number = number * 10 + s[i] - '0';

                }

                else{

                    number_stack.push(number);

                    if (compuate_flag == 1){

                        compute(number_stack, operation_stack);

                    }

                    number = 0;

                    i--;

                    STATE = OPERATION_STATE;

                }

                break;

            case OPERATION_STATE:

                if (s[i] == '+' || s[i] == '-'){

                    operation_stack.push(s[i]);

                    compuate_flag = 1;

                }

                else if (s[i] == '('){

                    STATE = NUMBER_STATE;

                    compuate_flag = 0;

                }

                else if (s[i] >= '0' && s[i] <= '9'){

                    STATE = NUMBER_STATE;                   

                    i--;

                }

                else if (s[i] == ')'){

                    compute(number_stack, operation_stack);

                }

                break;

            }

        }

        if (number != 0){

            number_stack.push(number);

            compute(number_stack, operation_stack);

        }

        if (number == 0 && number_stack.empty()){

            return 0;

        }

        return number_stack.top();

    }

   void compute(std::stack<int> &number_stack,

                 std::stack<char> &operation_stack){

        if (number_stack.size() < 2){

            return;

        }

        int num2 = number_stack.top();

        number_stack.pop();

        int num1 = number_stack.top();

        number_stack.pop();

        if (operation_stack.top() == '+'){

            number_stack.push(num1 + num2);

        }

        else if(operation_stack.top() == '-'){

            number_stack.push(num1 - num2);

        }

        operation_stack.pop();

    }

};

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值