问题
给出一个计算表达式例如:
19--4=2?
返回?可能代表的最小数字,注意:
- ?表示0-9中的任意一个数字,且?只出现在数字中。
- ?的值不能是表达式中已经存在的
- 表达式中不能有0开头的两位以上的数字
例子
assertEquals( "Answer for expression '1+1=?' " , 2 , Runes.solveExpression("1+1=?") );
assertEquals( "Answer for expression '123*45?=5?088' " , 6 , Runes.solveExpression("123*45?=5?088") );
assertEquals( "Answer for expression '-5?*-1=5?' " , 0 , Runes.solveExpression("-5?*-1=5?") );
assertEquals( "Answer for expression '19--45=5?' " , -1 , Runes.solveExpression("19--45=5?") );
assertEquals( "Answer for expression '??*??=302?' " , 5 , Runes.solveExpression("??*??=302?") );
assertEquals( "Answer for expression '?*11=??' " , 2 , Runes.solveExpression("?*11=??") );
assertEquals( "Answer for expression '??*1=??' " , 2 , Runes.solveExpression("??*1=??") );
我的代码
package codewars;
import java.util.List;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class Runes {
public static Pattern p = Pattern.compile("(-*[0-9?]+)([\\*\\+-])(-*[0-9?]+)=(-*[0-9?]+)$");
public static int solveExpression( final String expression ) {
int missingDigit = -1;
Matcher m = p.matcher(expression);
m.find();
String a = m.group(1);
String operator = m.group(2);
String b = m.group(3);
String result = m.group(4);
List<Integer> list = IntStream.range(0, 10).filter(e -> !(a.contains(e+"") || b.contains(e+"") || result.contains(e+""))).filter(e -> {
if (e == 0) {
String a1 = a.replaceAll("-", "");
String b1 = b.replaceAll("-", "");
String result1 = result.replaceAll("-", "");
if ((a1.startsWith("?") && a1.length() > 1) || (b1.startsWith("?") && b1.length() > 1) || (result1.startsWith("?") && result1.length() > 1)) {
return false;
}
}
Integer v1 = Integer.parseInt(a.replaceAll("\\?", e+""));
Integer v2 = Integer.parseInt(b.replaceAll("\\?", e+""));
Integer v3 = Integer.parseInt(result.replaceAll("\\?", e+""));
switch (operator) {
case "+":
return (v1 + v2) == v3;
case "-":
return (v1 - v2) == v3;
case "*":
return (v1 * v2) == v3;
default:
return false;
}
}).boxed().collect(Collectors.toList());
if (list.size() == 0) {
return missingDigit;
} else {
return list.get(0);
}
}
public static void main(String[] args) {
System.out.println(Runes.solveExpression("19--4=2?"));
}
}
分析
这道题不难,思路无非就是穷举所有可能的?值。主要是写正则表达式花了比较长时间。