-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathexpressionEval.java
More file actions
125 lines (105 loc) · 2.92 KB
/
Copy pathexpressionEval.java
File metadata and controls
125 lines (105 loc) · 2.92 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
import java.util.*;
class expressionEval {
public static int compute(String operator, int num1, int num2){
//System.out.println(operator);
//System.out.println(operator == "/");
if(operator.equals("*")){
return num1*num2;
}
else if(operator.equals("-")){
return num1-num2;
}
else if(operator.equals("/")){
return num1/num2;
}
else{
return num1+num2;
}
}
public static void printArray(String[] array){
int i = 0;
while(i < array.length){
System.out.print(array[i]);
i++;
}
System.out.println();
}
public static String solveExpression(String expression){
Set<String> operators = new HashSet<String>(Arrays.asList("+","/","*","-"));
String expressionElements[] = expression.split(" ");
int size = expressionElements.length;
int i;
int j;
int leftNumber;
int rightNumber;
int value;
//printArray(expressionElements);
while(size > 1){
i = 0;
j = 0;
while(i<size - 2){
//System.out.println(operators.contains(expressionElements[i]));
if(operators.contains(expressionElements[i]) && !operators.contains(expressionElements[i+1])&&!operators.contains(expressionElements[i+2])){
leftNumber = Integer.parseInt(expressionElements[i+1]);
rightNumber = Integer.parseInt(expressionElements[i+2]);
value = compute(expressionElements[i],leftNumber,rightNumber);
expressionElements[j] = Integer.toString(value);
//System.out.println(j+" "+value);
j++;
i+=3;
}
else{
expressionElements[j] = expressionElements[i];
i++;
j++;
}
}
size = j+1;
//printArray(expressionElements);
}
return expressionElements[0];
}
public static void runTest(){
//Base cases
String exp1 = "1";
String exp2 = "+ 1 2";
//Connected expressions
String exp3 = "+ + 1 2 + 3 4";
String exp4 = "/ + 4 2 + 1 2";
//All operators in one expression
String exp5 = "/ * + 3 0 + 1 2 - 4 1";
// lopsided expression
String exp6 = "+ 1 + 2 + 3 + 4 5";
// negative
String exp7 = "+ -1 2";
if(solveExpression(exp1).equals("1")){
System.out.println("Test 1 passed(base): 1 = 1");
}
if(solveExpression(exp2).equals("3")){
System.out.println("Test 2 passed(base): + 1 2 = 3");
}
if(solveExpression(exp3).equals("10")){
System.out.println("Test 3 passed(connected): + 1 2 + 3 4 = 10");
}
if(solveExpression(exp4).equals("2")){
System.out.println("Test 4 passed(connected): / + 4 2 + 1 2 = 2");
}
if(solveExpression(exp5).equals("3")){
System.out.println("Test 5 passed(all operators): / * + 3 0 + 1 2 - 4 1 = 3 * 3 / 3 = 3");
}
if(solveExpression(exp6).equals("15")){
System.out.println("Test 6 passed(lopsided): + 1 + 2 + 3 + 4 5 = 15");
}
if(solveExpression(exp7).equals("1")){
System.out.println("Test 7 passed(Negative): + -1 2 = 1");
}
}
public static void main(String[] args)
{
runTest();
System.out.println("Enter custom expression: ");
Scanner scan = new Scanner(System.in);
String expression = scan.nextLine();
System.out.println(solveExpression(expression));
}
}