liangjinglin/liang-leetCode
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

2025-01-13 用栈实现计算器-优化（多位数计算）

Browse Source
This commit is contained in:
liangjinglin 2025-01-14 00:42:31 +08:00
parent 6c51073f51
commit bba8bce10f
1 changed files with 11 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
src/dataANDcalc/java/stack/CalculatorByStack.java
View File

@ -19,11 +19,12 @@ public class CalculatorByStack {
public void calculate(String expression) { public void calculate(String expression) {
int length = expression.length(); int length = expression.length();
String numStr = "";
for (int i = 0; i<length;i++){ for (int i = 0; i<length;i++){
String str = expression.substring(i,i+1); String str = expression.substring(i,i+1);
String operRegex = "[+\\-*/]"; String operRegex = "[+\\-*/]";
Pattern operPattern = Pattern.compile(operRegex); Pattern operPattern = Pattern.compile(operRegex);
if (operPattern.matcher(String.valueOf(str)).matches()) { if (operPattern.matcher(str).matches()) {
if("+".equals(str)){ if("+".equals(str)){
if(operStack.isEmpty()){ if(operStack.isEmpty()){
operStack.push(ADD); operStack.push(ADD);
@ -57,8 +58,15 @@ public class CalculatorByStack {
operStack.push(DIV); operStack.push(DIV);
} }
}else { }else {
int num = Integer.parseInt(str); numStr += str;
numStack.push(num); if (i == expression.length()-1){
numStack.push(Integer.parseInt(numStr));
continue;
}
if (operPattern.matcher(expression.substring(i+1,i+2)).matches()){
numStack.push(Integer.parseInt(numStr));
numStr = "";
}
} }
} }