简单计算器

 简单四则运算表达式计算(仅包含+,-,*,/,(,)),构造的二叉树左儿子是数,右儿子是操作符

 

代码:

简单计算器(C++) 

#include "iostream"
#include "cstring"
#include "algorithm"
#include "cmath"
#include "cstdio"
#include "sstream"
#include "queue"
#include "vector"
#include "string"
#include "stack"
#include "cstdlib"
#include "deque"
#include "fstream"
using namespace std;
typedef long long LL;
const int INF = 0x6fffffff;
stack<double> NS;
stack<char> OS;

void update()
{
    char op = OS.top(); OS.pop();
    double n1 = NS.top(); NS.pop();
    double n2 = NS.top(); NS.pop();

    if(op == '+')
        NS.push(n1+n2);
    else if(op == '-')
        NS.push(n2-n1);
    else if(op == '*')
        NS.push(n1*n2);
    else if(op == '/')
        NS.push(n2/n1);
}

void dfs(string line)
{
    for(int i = 0 ; i < line.size() ; i++)
    {
        if(line[i] == ' ')
            continue;

        if(line[i] == '+' || line[i] == '-')
        {
            while(!OS.empty() &&(OS.top() != '(' && OS.top() != ')' ))
                update();
            OS.push(line[i]);
        }

        else if(line[i] == '*' || line[i] == '/')
        {
            while(!OS.empty() && (OS.top() == '*' || OS.top() == '/'))
                update();
            OS.push(line[i]);
        }

        else if(line[i] == '(')
            OS.push('(');
        else if(line[i] == ')')
        {
            while(OS.top() != '(')
                update();
            OS.pop();
        }
        else
        {
            int num=0;
            while(isdigit(line[i]))
            {
                num  = num*10+(line[i]-'0');
                i++;
            }
            i--;

            NS.push(num);
        }
    }

    while(!OS.empty())
        update();

    printf("%.2lf\n",NS.top());
}

int main()
{
    string line;

    while(getline(cin,line) && line != "0")
    {
        while(!OS.empty())
            OS.pop();
        while(!NS.empty())
            NS.pop();

        dfs(line);
    }
    return 0;
}



简单计算器(java)

import java.io.*;
import java.util.*;

public class Main {

        public static void main(String[] argv)  throws IOException
        {
        	Scanner in = new Scanner(new BufferedInputStream(System.in));


        	while(in.hasNext())
        	{
        		String line = in.nextLine();

        		if(line.length() < 1)
        			continue;

        		if(line.equals("0"))
        			break;

        		double ans = dfs(line);

        		/*if(ans == 0)
        			System.out.println(0);
        		else*/
        			System.out.printf("%.2f\n",ans);

        	}

        }

        static double dfs(String line)
        {
        	Stack<Double> NS = new Stack<Double>();
        	Stack<Character> OS = new Stack<Character>();

        	StringTokenizer tokens = new StringTokenizer(line , "()+-*/" , true);

        	while(tokens.hasMoreTokens())
        	{
        		String cur = tokens.nextToken().trim();

        		if(cur.charAt(0) == '+' || cur.charAt(0) == '-')
        		{
        			while(!OS.isEmpty() &&
        				   (OS.peek() == '+' ||
        					OS.peek() == '-' ||
        					OS.peek() == '*' ||
        					OS.peek() == '/' ))
        				update(NS,OS);

        			OS.push(cur.charAt(0));
        		}

        		else if(cur.charAt(0) == '*' || cur.charAt(0) == '/')
        		{
        			while(!OS.empty() &&
        					(OS.peek() == '*' ||
        					 OS.peek() == '/'))
        				update(NS,OS);

        			OS.push(cur.charAt(0));
        		}

        		else if(cur.trim().charAt(0) == '(')
        			OS.push('(');
        		else if(cur.trim().charAt(0) == ')')
        		{
        			while(OS.peek() != '(')
        				update(NS,OS);

        			OS.pop();
        		}
        		else
        			NS.push(new Double(cur));

        	}

        	while(!OS.empty())
        		update(NS,OS);

        	return NS.pop();

        }

        static void update(Stack<Double> NS , Stack<Character> OS)
        {
        	char op = OS.pop();
        	double n1 = NS.pop();
        	double n2 = NS.pop();

        	if(op == '+')
        		NS.push(n1+n2);
        	else if(op == '-')
        		NS.push(n2-n1);
        	else if(op == '*')
        		NS.push(n1*n2);
        	else if(op == '/')
        		NS.push(n2/n1);
        }
}


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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值