JAVA实现四则运算
来源:互联网 发布:淘宝店铺装修上传宝贝 编辑:程序博客网 时间:2024/06/04 18:47
JAVA实现四则运算
/*
* WmsCalculator.java
*
* Created on 2007年6月12日, 下午2:56
*
* To change this template, choose Tools | Template Manager
* and open the template in the editor.
*/
package com.zami.wms.function.report.objects;
/**
*
* @author zzh
*/
import java.lang.reflect.Array;
import java.util.*;
import java.util.regex.*;
import java.lang.*;
import java.io.*;
//测试用例:1-3*(4-(2+5*3)+5)-6/(1+2)=23
//测试用例:11.2+3.1*(423-(2+5.7*3.4)+5.6)-6.4/(15.5+24)=1273.4199746835445
public class WmsCalculator {
public static void main(String[] args) throws IOException {
String str_input;
double f_output;
while (true) {
System.out.print("输入表达式: ");
System.out.flush();
str_input = getString();
if (str_input.equals("")) {
break;
}
WmsCalculator calculator = new WmsCalculator();
//以下对输入字符串做规则处理
str_input = calculator.checkExpression(str_input);
if (str_input.equals("")) {
System.out.println(" 表达式出错 ");
}
//以下对输入字符串做表达式转换
Vector<String> v_compute = calculator.getExpression(str_input);
//以下进行后缀表达式转换
Vector<String> v_tmp_prefix = calculator.transformPrefix(v_compute);
//以下进行后缀表达式运算
f_output = calculator.evaluatePrefix(v_tmp_prefix);
System.out.println("结果 = " + f_output);
}
}
public static String calculator(String function){
WmsCalculator calculator = new WmsCalculator();
//以下对输入字符串做规则处理
function = calculator.checkExpression(function);
if (function.equals("")) {
System.out.println(" 表达式出错 ");
return null;
}
//以下对输入字符串做表达式转换
Vector<String> v_compute = calculator.getExpression(function);
//以下进行后缀表达式转换
Vector<String> v_tmp_prefix = calculator.transformPrefix(v_compute);
//以下进行后缀表达式运算
double result = calculator.evaluatePrefix(v_tmp_prefix);
return String.valueOf(result);
}
/**
*静态方法,用来从控制台读入表达式
*/
public static String getString() throws IOException {
InputStreamReader isr = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(isr);
String s = br.readLine();
return s;
}
/**
*输入字符串转换.把从控制台读入的字符串转成表达式存在一个队列中.
*例:123+321 存为"123""+""321"
*/
public Vector<String> getExpression(String str) {
Vector<String> v_temp = new Vector<String>();
char[] temp = new char[str.length()];
str.getChars(0,str.length(),temp,0);
String fi = "";
int x=0,i=0;
String regex_fig = "[/./d]"; //匹配数字和小数点
String regex_operator = "[/+/-/*//(/)]"; //匹配运算符(+,-,*,/)和括号("(",")")
Pattern p_fig = Pattern.compile(regex_fig);
Pattern p_operator = Pattern.compile(regex_operator);
Matcher m = null;
boolean b;
while (i<str.length()) {
Character c = new Character(temp[i]);
String s = c.toString();
//System.out.println("char c = "+s);
m = p_operator.matcher(s);
b = m.matches();
if (b) {
//System.out.println("matches operator");
v_temp.add(fi);
fi="";
v_temp.add(s);
}
m = p_fig.matcher(s);
b = m.matches();
if (b) {
//System.out.println("matches fig");
fi=fi+s;
}
i++;
}
v_temp.add(fi);
return v_temp;
}
/**
*转换中序表示式为前序表示式
*/
public Vector<String> transformPrefix(Vector<String> v_expression) {
Vector<String> v_prefix = new Vector<String>();
Stack<String> s_tmp = new Stack<String>();
String regex_float = "/d+(/./d+)?"; //匹配正浮点数
Pattern p_float = Pattern.compile(regex_float);
Matcher m = null;
boolean b;
String str_elem = "";
for (int i=0;i<v_expression.size();i++ ) {
str_elem = v_expression.get(i).toString();
m = p_float.matcher(str_elem);
b = m.matches();
if (b) {
v_prefix.add(str_elem);
}
if (str_elem.equals("+")||str_elem.equals("-")) {
if (s_tmp.isEmpty()) {
s_tmp.push(str_elem);
} else {
while(!s_tmp.isEmpty()) {
String str_tmp = s_tmp.peek();
if ( str_tmp.equals("(")) {
break;
} else {
v_prefix.add(s_tmp.pop());
}
}
s_tmp.push(str_elem);
}
}
if (str_elem.equals("*")||str_elem.equals("/")) {
if (s_tmp.isEmpty()) {
s_tmp.push(str_elem);
} else {
while(!s_tmp.isEmpty()) {
String str_tmp = s_tmp.peek();
if ( str_tmp.equals("(") || str_tmp.equals("+") || str_tmp.equals("-")) {
break;
} else {
v_prefix.add(s_tmp.pop());
}
}
s_tmp.push(str_elem);
}
}
if (str_elem.equals("(")) {
s_tmp.push(str_elem);
}
if (str_elem.equals(")")) {
while(!s_tmp.isEmpty()) {
String str_tmp = s_tmp.peek();
if (str_tmp.equals("(")) {
s_tmp.pop();
break;
} else {
v_prefix.add(s_tmp.pop());
}
}
}
}
while(!s_tmp.isEmpty()) {
v_prefix.add(s_tmp.pop());
}
return v_prefix;
}
/**
*前缀表示式求值
*/
public strictfp double evaluatePrefix(Vector<String> v_prefix) {
String str_tmp = "";
double num1,num2,interAns = 0;
Stack<Double> s_compute = new Stack<Double>();
int i = 0;
while(i<v_prefix.size()) {
str_tmp = v_prefix.get(i).toString();
if (!str_tmp.equals("+") && !str_tmp.equals("-") && !str_tmp.equals("*") && !str_tmp.equals("/")) {
interAns = s_compute.push(Double.parseDouble(str_tmp));
} else {
num2=(Double)(s_compute.pop());
num1=(Double)(s_compute.pop());
if (str_tmp.equals("+")) {
interAns = num1+num2;
}
if (str_tmp.equals("-")) {
interAns = num1-num2;
}
if (str_tmp.equals("*")) {
interAns = num1*num2;
}
if (str_tmp.equals("/")) {
interAns = num1/num2;
}
s_compute.push(interAns);
}
i++;
}
return interAns;
}
/**
*括号匹配检测
*/
public boolean checkBracket(String str) {
Stack<Character> s_check = new Stack<Character>();
boolean b_flag = true;
for (int i=0;i<str.length();i++) {
char ch = str.charAt(i);
switch(ch) {
case '(':
s_check.push(ch);
break;
case ')':
if (!s_check.isEmpty()) {
char chx = s_check.pop();
if (ch==')' && chx!='(') {
b_flag = false;
}
} else {
b_flag = false;
}
break;
default:
break;
}
}
if (!s_check.isEmpty()) {
b_flag = false;
}
return b_flag;
}
/**
*表达式正确性规则处理与校验
*/
public String checkExpression(String str) {
Stack<Character> s_check = new Stack<Character>();
Stack<Character> s_tmp = new Stack<Character>();
String str_result = "";
String str_regex = "^[/./d/+/-/*//(/)]+$"; //匹配合法的运算字符"数字,.,+,-,*,/,(,),"
Pattern p_filtrate = Pattern.compile(str_regex);
Matcher m = p_filtrate.matcher(str);
boolean b_filtrate = m.matches();
if (!b_filtrate) {
str_result = "";
return str_result;
}
String str_err_float = ".*(/./d*){2,}.*"; //匹配非法的浮点数.
Pattern p_err_float = Pattern.compile(str_err_float);
Matcher m_err_float = p_err_float.matcher(str);
boolean b_err_float = m_err_float.matches();
if (b_err_float) {
str_result = "";
return str_result;
}
for (int i=0;i<str.length();i++) {
char ch = str.charAt(i);
if (checkFig(ch)) {
if (!s_tmp.isEmpty()&&s_tmp.peek()==')') {
str_result = "";
return str_result;
}
s_tmp.push(ch);
str_result = str_result+ch;
}
switch(ch) {
case '(':
if (!s_tmp.isEmpty()&&s_tmp.peek()=='.') {
str_result = "";
return str_result;
}
s_check.push(ch);
if (s_tmp.isEmpty()||(!this.checkFig(s_tmp.peek())&&s_tmp.peek()!=')')) {
str_result = str_result+ch;
} else {
str_result = str_result+"*"+ch;
}
s_tmp.push(ch);
break;
case ')':
if (!s_check.isEmpty()) {
char chx = s_check.pop();
if (ch==')' && chx!='(') {
str_result = "";
return str_result;
}
} else {
str_result = "";
return str_result;
}
if (s_tmp.peek()=='.'||(!this.checkFig(s_tmp.peek())&&s_tmp.peek()!=')')) {
str_result = "";
return str_result;
}
s_tmp.push(ch);
str_result = str_result+ch;
break;
case '+':
case '-':
if (!s_tmp.isEmpty()&&(s_tmp.peek()=='+'||s_tmp.peek()=='-'||s_tmp.peek()=='*'||s_tmp.peek()=='/'||s_tmp.peek()=='.')) {
str_result = "";
return str_result;
}
if (s_tmp.isEmpty()||s_tmp.peek()=='(') {
str_result = str_result+"0"+ch;
} else {
str_result = str_result+ch;
}
s_tmp.push(ch);
break;
case '*':
case '/':
if (s_tmp.isEmpty()||s_tmp.peek()=='.'||(!this.checkFig(s_tmp.peek())&&s_tmp.peek()!=')')) {
str_result = "";
return str_result;
}
s_tmp.push(ch);
str_result = str_result+ch;
break;
case '.':
if (s_tmp.isEmpty()||!this.checkFig(s_tmp.peek())) {
str_result = str_result+"0"+ch;
} else {
str_result = str_result+ch;
}
s_tmp.push(ch);
break;
default:
break;
}
}
if (!s_check.isEmpty()) {
str_result = "";
return str_result;
}
return str_result;
}
private static boolean checkFig(Object ch) {
String s = ch.toString();
String str_regexfig = "/d"; //匹配数字
Pattern p_fig = Pattern.compile(str_regexfig);
Matcher m_fig = p_fig.matcher(s) ;
boolean b_fig = m_fig.matches();
return b_fig;
}
};
* WmsCalculator.java
*
* Created on 2007年6月12日, 下午2:56
*
* To change this template, choose Tools | Template Manager
* and open the template in the editor.
*/
package com.zami.wms.function.report.objects;
/**
*
* @author zzh
*/
import java.lang.reflect.Array;
import java.util.*;
import java.util.regex.*;
import java.lang.*;
import java.io.*;
//测试用例:1-3*(4-(2+5*3)+5)-6/(1+2)=23
//测试用例:11.2+3.1*(423-(2+5.7*3.4)+5.6)-6.4/(15.5+24)=1273.4199746835445
public class WmsCalculator {
public static void main(String[] args) throws IOException {
String str_input;
double f_output;
while (true) {
System.out.print("输入表达式: ");
System.out.flush();
str_input = getString();
if (str_input.equals("")) {
break;
}
WmsCalculator calculator = new WmsCalculator();
//以下对输入字符串做规则处理
str_input = calculator.checkExpression(str_input);
if (str_input.equals("")) {
System.out.println(" 表达式出错 ");
}
//以下对输入字符串做表达式转换
Vector<String> v_compute = calculator.getExpression(str_input);
//以下进行后缀表达式转换
Vector<String> v_tmp_prefix = calculator.transformPrefix(v_compute);
//以下进行后缀表达式运算
f_output = calculator.evaluatePrefix(v_tmp_prefix);
System.out.println("结果 = " + f_output);
}
}
public static String calculator(String function){
WmsCalculator calculator = new WmsCalculator();
//以下对输入字符串做规则处理
function = calculator.checkExpression(function);
if (function.equals("")) {
System.out.println(" 表达式出错 ");
return null;
}
//以下对输入字符串做表达式转换
Vector<String> v_compute = calculator.getExpression(function);
//以下进行后缀表达式转换
Vector<String> v_tmp_prefix = calculator.transformPrefix(v_compute);
//以下进行后缀表达式运算
double result = calculator.evaluatePrefix(v_tmp_prefix);
return String.valueOf(result);
}
/**
*静态方法,用来从控制台读入表达式
*/
public static String getString() throws IOException {
InputStreamReader isr = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(isr);
String s = br.readLine();
return s;
}
/**
*输入字符串转换.把从控制台读入的字符串转成表达式存在一个队列中.
*例:123+321 存为"123""+""321"
*/
public Vector<String> getExpression(String str) {
Vector<String> v_temp = new Vector<String>();
char[] temp = new char[str.length()];
str.getChars(0,str.length(),temp,0);
String fi = "";
int x=0,i=0;
String regex_fig = "[/./d]"; //匹配数字和小数点
String regex_operator = "[/+/-/*//(/)]"; //匹配运算符(+,-,*,/)和括号("(",")")
Pattern p_fig = Pattern.compile(regex_fig);
Pattern p_operator = Pattern.compile(regex_operator);
Matcher m = null;
boolean b;
while (i<str.length()) {
Character c = new Character(temp[i]);
String s = c.toString();
//System.out.println("char c = "+s);
m = p_operator.matcher(s);
b = m.matches();
if (b) {
//System.out.println("matches operator");
v_temp.add(fi);
fi="";
v_temp.add(s);
}
m = p_fig.matcher(s);
b = m.matches();
if (b) {
//System.out.println("matches fig");
fi=fi+s;
}
i++;
}
v_temp.add(fi);
return v_temp;
}
/**
*转换中序表示式为前序表示式
*/
public Vector<String> transformPrefix(Vector<String> v_expression) {
Vector<String> v_prefix = new Vector<String>();
Stack<String> s_tmp = new Stack<String>();
String regex_float = "/d+(/./d+)?"; //匹配正浮点数
Pattern p_float = Pattern.compile(regex_float);
Matcher m = null;
boolean b;
String str_elem = "";
for (int i=0;i<v_expression.size();i++ ) {
str_elem = v_expression.get(i).toString();
m = p_float.matcher(str_elem);
b = m.matches();
if (b) {
v_prefix.add(str_elem);
}
if (str_elem.equals("+")||str_elem.equals("-")) {
if (s_tmp.isEmpty()) {
s_tmp.push(str_elem);
} else {
while(!s_tmp.isEmpty()) {
String str_tmp = s_tmp.peek();
if ( str_tmp.equals("(")) {
break;
} else {
v_prefix.add(s_tmp.pop());
}
}
s_tmp.push(str_elem);
}
}
if (str_elem.equals("*")||str_elem.equals("/")) {
if (s_tmp.isEmpty()) {
s_tmp.push(str_elem);
} else {
while(!s_tmp.isEmpty()) {
String str_tmp = s_tmp.peek();
if ( str_tmp.equals("(") || str_tmp.equals("+") || str_tmp.equals("-")) {
break;
} else {
v_prefix.add(s_tmp.pop());
}
}
s_tmp.push(str_elem);
}
}
if (str_elem.equals("(")) {
s_tmp.push(str_elem);
}
if (str_elem.equals(")")) {
while(!s_tmp.isEmpty()) {
String str_tmp = s_tmp.peek();
if (str_tmp.equals("(")) {
s_tmp.pop();
break;
} else {
v_prefix.add(s_tmp.pop());
}
}
}
}
while(!s_tmp.isEmpty()) {
v_prefix.add(s_tmp.pop());
}
return v_prefix;
}
/**
*前缀表示式求值
*/
public strictfp double evaluatePrefix(Vector<String> v_prefix) {
String str_tmp = "";
double num1,num2,interAns = 0;
Stack<Double> s_compute = new Stack<Double>();
int i = 0;
while(i<v_prefix.size()) {
str_tmp = v_prefix.get(i).toString();
if (!str_tmp.equals("+") && !str_tmp.equals("-") && !str_tmp.equals("*") && !str_tmp.equals("/")) {
interAns = s_compute.push(Double.parseDouble(str_tmp));
} else {
num2=(Double)(s_compute.pop());
num1=(Double)(s_compute.pop());
if (str_tmp.equals("+")) {
interAns = num1+num2;
}
if (str_tmp.equals("-")) {
interAns = num1-num2;
}
if (str_tmp.equals("*")) {
interAns = num1*num2;
}
if (str_tmp.equals("/")) {
interAns = num1/num2;
}
s_compute.push(interAns);
}
i++;
}
return interAns;
}
/**
*括号匹配检测
*/
public boolean checkBracket(String str) {
Stack<Character> s_check = new Stack<Character>();
boolean b_flag = true;
for (int i=0;i<str.length();i++) {
char ch = str.charAt(i);
switch(ch) {
case '(':
s_check.push(ch);
break;
case ')':
if (!s_check.isEmpty()) {
char chx = s_check.pop();
if (ch==')' && chx!='(') {
b_flag = false;
}
} else {
b_flag = false;
}
break;
default:
break;
}
}
if (!s_check.isEmpty()) {
b_flag = false;
}
return b_flag;
}
/**
*表达式正确性规则处理与校验
*/
public String checkExpression(String str) {
Stack<Character> s_check = new Stack<Character>();
Stack<Character> s_tmp = new Stack<Character>();
String str_result = "";
String str_regex = "^[/./d/+/-/*//(/)]+$"; //匹配合法的运算字符"数字,.,+,-,*,/,(,),"
Pattern p_filtrate = Pattern.compile(str_regex);
Matcher m = p_filtrate.matcher(str);
boolean b_filtrate = m.matches();
if (!b_filtrate) {
str_result = "";
return str_result;
}
String str_err_float = ".*(/./d*){2,}.*"; //匹配非法的浮点数.
Pattern p_err_float = Pattern.compile(str_err_float);
Matcher m_err_float = p_err_float.matcher(str);
boolean b_err_float = m_err_float.matches();
if (b_err_float) {
str_result = "";
return str_result;
}
for (int i=0;i<str.length();i++) {
char ch = str.charAt(i);
if (checkFig(ch)) {
if (!s_tmp.isEmpty()&&s_tmp.peek()==')') {
str_result = "";
return str_result;
}
s_tmp.push(ch);
str_result = str_result+ch;
}
switch(ch) {
case '(':
if (!s_tmp.isEmpty()&&s_tmp.peek()=='.') {
str_result = "";
return str_result;
}
s_check.push(ch);
if (s_tmp.isEmpty()||(!this.checkFig(s_tmp.peek())&&s_tmp.peek()!=')')) {
str_result = str_result+ch;
} else {
str_result = str_result+"*"+ch;
}
s_tmp.push(ch);
break;
case ')':
if (!s_check.isEmpty()) {
char chx = s_check.pop();
if (ch==')' && chx!='(') {
str_result = "";
return str_result;
}
} else {
str_result = "";
return str_result;
}
if (s_tmp.peek()=='.'||(!this.checkFig(s_tmp.peek())&&s_tmp.peek()!=')')) {
str_result = "";
return str_result;
}
s_tmp.push(ch);
str_result = str_result+ch;
break;
case '+':
case '-':
if (!s_tmp.isEmpty()&&(s_tmp.peek()=='+'||s_tmp.peek()=='-'||s_tmp.peek()=='*'||s_tmp.peek()=='/'||s_tmp.peek()=='.')) {
str_result = "";
return str_result;
}
if (s_tmp.isEmpty()||s_tmp.peek()=='(') {
str_result = str_result+"0"+ch;
} else {
str_result = str_result+ch;
}
s_tmp.push(ch);
break;
case '*':
case '/':
if (s_tmp.isEmpty()||s_tmp.peek()=='.'||(!this.checkFig(s_tmp.peek())&&s_tmp.peek()!=')')) {
str_result = "";
return str_result;
}
s_tmp.push(ch);
str_result = str_result+ch;
break;
case '.':
if (s_tmp.isEmpty()||!this.checkFig(s_tmp.peek())) {
str_result = str_result+"0"+ch;
} else {
str_result = str_result+ch;
}
s_tmp.push(ch);
break;
default:
break;
}
}
if (!s_check.isEmpty()) {
str_result = "";
return str_result;
}
return str_result;
}
private static boolean checkFig(Object ch) {
String s = ch.toString();
String str_regexfig = "/d"; //匹配数字
Pattern p_fig = Pattern.compile(str_regexfig);
Matcher m_fig = p_fig.matcher(s) ;
boolean b_fig = m_fig.matches();
return b_fig;
}
};
- JAVA实现四则运算
- 四则运算JAVA实现
- java实现网络四则运算
- 四则运算java实现
- JAVA实现字符串四则运算
- Java实现简单四则运算
- Java实现四则运算的解析
- Java实现四则运算表达式计算
- java 四则运算 栈的实现
- java 四则运算 栈的实现
- java利用栈实现四则运算
- 四则运算 栈实现 Java版
- java 四则运算 栈的实现
- java中FOR循环实现累加、四则运算
- java 实现带括号的加减乘除四则运算
- java实现逆波兰式四则运算
- java实现大整数的四则运算
- java简单计算器实现,只有四则运算
- 中国车牌号的识别[全](转)
- How time fly!
- java的23种模式(生活版)
- Eclipse3.1.1+EclipseME1.5+WTK2.2搭建J2ME开发环境
- 释放C#资源
- JAVA实现四则运算
- 事务的隔离级别1 (TRANSACTION ISOLATION LEVEL)
- Developer.Express.NET.Windows.Forms.Components控件介绍及下载
- win32api: WaitForSingleObject() DeviceloControl()介绍
- C1189:WINDOWS.H already included
- 盖茨谈机器人未来
- 两个有用的oracle数据库运算:intersect和minus运算
- java2入门经典(读书笔记)
- 用mod_jk2.so配置apache2.0.48和Tomcat5.0.19(转)