package DataStrTest;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.Stack;
public class Counter {
public static double con(String str) {
Stack<Character> ss = new Stack<>();
List list = new ArrayList();
for (int i = 0; i < str.length(); i++) {
char c = str.charAt(i);
if (Character.isDigit(c) || c == '.') {
StringBuilder s = new StringBuilder();
while (i < str.length() && (Character.isDigit(c=str.charAt(i)) || c == '.')) {
s.append(c);
i++;
}
list.add(Double.valueOf(s.toString()));
i--;
}
else {
if (ss.isEmpty()) {
ss.push(c);
}
else if(c=='('||ss.peek()=='('){
ss.push(c);
}
else if (c == ')') {
for (int j = ss.size()-1; j>=0; j--) {
if(ss.get(j)=='('){
ss.pop();
break;
}
else{
char b = ss.pop();
list.add(b);
}
}
}
else {
if (pro(c) > pro(ss.peek())) {
ss.push(c);
}
else {
char m=ss.peek();
while(!ss.isEmpty()&&pro(c) <= pro(m)){
char b = ss.pop();
list.add(b);
if(!ss.isEmpty()){
m=ss.peek();
}
}
ss.push(c);
}
}
}
}
while (!ss.isEmpty()) {
if (ss.peek() != '(') {
char b = ss.pop();
list.add(b);
} else {
ss.pop();
}
}
Stack<Double> st=new Stack<>();
for (int i = 0; i <list.size(); i++) {
String s=String.valueOf(list.get(i));
if(s.equals("+")||s.equals("-")||s.equals("*")||s.equals("/")||s.equals("^")||s.equals("%")){
double a=st.pop();
double b=st.pop();
double c=cov(b,a,s);
st.push(c);
}
else{
double c=Double.valueOf(s);
st.push(c);
}
}
return st.peek();
}
public static double cov(double a,double b,String c){
if (c .equals("+") ) {
return a + b;
} else if ((c .equals("-"))) {
return a - b;
} else if ((c .equals("*"))) {
return a * b;
} else if ((c .equals("^"))) {
return Math.pow(a, b);
} else if ((c .equals("/"))) {
return a / b;
} else if ((c .equals("%"))) {
return a % b;
} else {
return -1;
}
}
public static int pro(char a) {//优先级比较,用于判断运算符入栈还是出栈进链表
if (a == '^') {
return 3;
} else if (a == '*' || a == '/' || a == '%') {
return 2;
} else if (a == '+' || a == '-') {
return 1;
}
return 0;
}
public static void main(String[] args) {
System.out.print("请输入表达式:");
Scanner input=new Scanner(System.in);
String str=input.nextLine();
System.out.println(con(0+str));
str=String.valueOf(con(0+str));
boolean flag=true;
while(1==1){//为了生成exe文件,等待机制。
String str1=input.nextLine();
str+=str1;
System.out.println(con(0+str));
str=String.valueOf(con(0+str));
}
}
}
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.Stack;
public class Counter {
public static double con(String str) {
Stack<Character> ss = new Stack<>();
List list = new ArrayList();
for (int i = 0; i < str.length(); i++) {
char c = str.charAt(i);
if (Character.isDigit(c) || c == '.') {
StringBuilder s = new StringBuilder();
while (i < str.length() && (Character.isDigit(c=str.charAt(i)) || c == '.')) {
s.append(c);
i++;
}
list.add(Double.valueOf(s.toString()));
i--;
}
else {
if (ss.isEmpty()) {
ss.push(c);
}
else if(c=='('||ss.peek()=='('){
ss.push(c);
}
else if (c == ')') {
for (int j = ss.size()-1; j>=0; j--) {
if(ss.get(j)=='('){
ss.pop();
break;
}
else{
char b = ss.pop();
list.add(b);
}
}
}
else {
if (pro(c) > pro(ss.peek())) {
ss.push(c);
}
else {
char m=ss.peek();
while(!ss.isEmpty()&&pro(c) <= pro(m)){
char b = ss.pop();
list.add(b);
if(!ss.isEmpty()){
m=ss.peek();
}
}
ss.push(c);
}
}
}
}
while (!ss.isEmpty()) {
if (ss.peek() != '(') {
char b = ss.pop();
list.add(b);
} else {
ss.pop();
}
}
Stack<Double> st=new Stack<>();
for (int i = 0; i <list.size(); i++) {
String s=String.valueOf(list.get(i));
if(s.equals("+")||s.equals("-")||s.equals("*")||s.equals("/")||s.equals("^")||s.equals("%")){
double a=st.pop();
double b=st.pop();
double c=cov(b,a,s);
st.push(c);
}
else{
double c=Double.valueOf(s);
st.push(c);
}
}
return st.peek();
}
public static double cov(double a,double b,String c){
if (c .equals("+") ) {
return a + b;
} else if ((c .equals("-"))) {
return a - b;
} else if ((c .equals("*"))) {
return a * b;
} else if ((c .equals("^"))) {
return Math.pow(a, b);
} else if ((c .equals("/"))) {
return a / b;
} else if ((c .equals("%"))) {
return a % b;
} else {
return -1;
}
}
public static int pro(char a) {//优先级比较,用于判断运算符入栈还是出栈进链表
if (a == '^') {
return 3;
} else if (a == '*' || a == '/' || a == '%') {
return 2;
} else if (a == '+' || a == '-') {
return 1;
}
return 0;
}
public static void main(String[] args) {
System.out.print("请输入表达式:");
Scanner input=new Scanner(System.in);
String str=input.nextLine();
System.out.println(con(0+str));
str=String.valueOf(con(0+str));
boolean flag=true;
while(1==1){//为了生成exe文件,等待机制。
String str1=input.nextLine();
str+=str1;
System.out.println(con(0+str));
str=String.valueOf(con(0+str));
}
}
}