mini dc - 20175218

mini dc

1、題目要求

提交測試截圖和碼雲練習項目連接，實現Linux下dc的功能，計算後綴表達式的值

2、代碼

一、產品代碼

import java.lang.String;
import java.util.StringTokenizer;
import java.util.Stack;
public class MyDC {
    /**
     * constant for addition symbol
     */
    private final char ADD = '+';
    /**
     * constant for subtraction symbol
     */
    private final char SUBTRACT = '-';
    /**
     * constant for multiplication symbol
     */
    private final char MULTIPLY = '*';
    /**
     * constant for division symbol
     */
    private final char DIVIDE = '/';
    /**
     * the stack
     */
    private Stack<Integer> stack;
 
    public MyDC() {
        stack = new Stack<Integer>();
    }
 
    public int evaluate(String expr) {
        int op1, op2, result = 0;
        String token;
        StringTokenizer tokenizer = new StringTokenizer(expr);
 
        while (tokenizer.hasMoreTokens()) {
            token = tokenizer.nextToken();
            //若是是運算符，調用isOperator
            if (isOperator(token)==true) {
                op2=stack.pop();
                op1=stack.pop();
                //從棧中彈出操做數2
                //從棧中彈出操做數1
                result=evalSingleOp(token.charAt(0),op1,op2);
                //根據運算符和兩個操做數調用evalSingleOp計算result;
                stack.push(result);
                //計算result入棧;
            }
            else//若是是操做數
            {
                stack.push(Integer.parseInt(token));
            }
            //操做數入棧;
        }
 
        return result;
    }
 
    private boolean isOperator(String token) {
        return (token.equals("+") || token.equals("-") ||
                token.equals("*") || token.equals("/"));
    }
 
    private int evalSingleOp(char operation, int op1, int op2) {
        int result = 0;
 
        switch (operation) {
            case ADD:
                result = op1 + op2;
                break;
            case SUBTRACT:
                result = op1 - op2;
                break;
            case MULTIPLY:
                result = op1 * op2;
                break;
            case DIVIDE:
                result = op1 / op2;
                break;
            default:return 0;
        }
        return result;
    }
}

二、測試代碼

import java.util.Scanner;
public class MyDCTest  {
    public static void main (String[] args) {
        String expression, again;
        int result;
        try
        {
            Scanner in = new Scanner(System.in);
            do
            {
                MyDC evaluator = new MyDC();
                System.out.println ("Enter a valid postfix expression: ");
                expression = in.nextLine();
 
                result = evaluator.evaluate (expression);
                System.out.println ("That expression equals " + result);
                System.out.print ("Evaluate another expression [Y/N]? ");
                again = in.nextLine();
                System.out.println();
            }
            while (again.equalsIgnoreCase("y"));
        }
        catch (Exception IOException)
        {
            System.out.println("Input exception reported");
        }
    }
}

3、運行截圖

4、代碼託管

(博客連接)(https://gitee.com/cjy-123/20175218cjy/tree/master/week11/test3)