Merge pull request '3' (#3) from develop into main
commit
b6de5ff1b8
@ -0,0 +1,51 @@
|
||||
import java.util.ArrayList;
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
|
||||
public class ExpressionBuilder {
|
||||
private static final Random RANDOM = new Random();
|
||||
private static final String[] OPERATORS = {"+", "-", "*", "/"};
|
||||
|
||||
// 生成基础四则运算表达式
|
||||
public String generateBasicExpression(int count) {
|
||||
StringBuilder sb = new StringBuilder();
|
||||
for (int i = 0; i < count; i++) {
|
||||
sb.append(RANDOM.nextInt(100) + 1);
|
||||
if (i < count - 1) {
|
||||
sb.append(" ").append(OPERATORS[RANDOM.nextInt(OPERATORS.length)]).append(" ");
|
||||
}
|
||||
}
|
||||
return sb.toString();
|
||||
}
|
||||
|
||||
// 获取表达式中数字的位置
|
||||
public List<Integer> getNumberPositions(String expression) {
|
||||
String[] tokens = expression.split(" ");
|
||||
List<Integer> positions = new ArrayList<>();
|
||||
for (int i = 0; i < tokens.length; i++) {
|
||||
if (isNumber(tokens[i])) positions.add(i);
|
||||
}
|
||||
return positions;
|
||||
}
|
||||
|
||||
// 检查是否存在除零
|
||||
public boolean hasDivideByZero(String expression) {
|
||||
String[] tokens = expression.split(" ");
|
||||
for (int i = 0; i < tokens.length - 1; i++) {
|
||||
if (tokens[i].equals("/")) {
|
||||
try {
|
||||
if (Integer.parseInt(tokens[i + 1]) == 0) return true;
|
||||
} catch (NumberFormatException e) {
|
||||
//
|
||||
}
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
//判断是否为数字位
|
||||
private boolean isNumber(String token) {
|
||||
try { Integer.parseInt(token); return true; }
|
||||
catch (NumberFormatException e) { return false; }
|
||||
}
|
||||
}
|
||||
@ -1,51 +1,36 @@
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
|
||||
/**
|
||||
* 生成初中题目
|
||||
*/
|
||||
public class JuniorProblem implements ProblemsGenerator {
|
||||
private static final Random RANDOM = new Random();
|
||||
private static final String[] OPERATORS = {"+", "-", "*", "/"};
|
||||
private static final String[] POW_OPERATORS = {"√", "^2"};
|
||||
private final BracketManager bracketManager = new BracketManager();
|
||||
private final PowerManager powerManager = new PowerManager();
|
||||
private final ExpressionBuilder expressionBuilder = new ExpressionBuilder();
|
||||
|
||||
@Override
|
||||
public String generate() {
|
||||
String primaryExpr = generatePrimaryExpression();
|
||||
return addPowerOperators(primaryExpr);
|
||||
}
|
||||
|
||||
private String generatePrimaryExpression() {
|
||||
int count = RANDOM.nextInt(4) + 2;
|
||||
StringBuilder sb = new StringBuilder();
|
||||
|
||||
for (int i = 0; i < count; i++) {
|
||||
sb.append(RANDOM.nextInt(100) + 1);
|
||||
if (i < count - 1) {
|
||||
sb.append(" ").append(OPERATORS[RANDOM.nextInt(OPERATORS.length)]).append(" ");
|
||||
}
|
||||
}
|
||||
return sb.toString();
|
||||
}
|
||||
|
||||
private String addPowerOperators(String expr) {
|
||||
String[] parts = expr.split(" ");
|
||||
boolean hasPower = false;
|
||||
String expression;
|
||||
boolean hasPower;
|
||||
do {
|
||||
int numCount = RANDOM.nextInt(5) + 1;
|
||||
expression = expressionBuilder.generateBasicExpression(numCount);
|
||||
List<Integer> numPositions = expressionBuilder.getNumberPositions(expression);
|
||||
|
||||
for (int i = 0; i < parts.length; i++) {
|
||||
if (parts[i].matches("\\d+") && (!hasPower || RANDOM.nextBoolean())) {
|
||||
String op = POW_OPERATORS[RANDOM.nextInt(POW_OPERATORS.length)];
|
||||
parts[i] = op.equals("√") ? "√" + parts[i] : parts[i] + "^2";
|
||||
hasPower = true;
|
||||
if (RANDOM.nextDouble() < 0.8) {
|
||||
int pairs = bracketManager.decideParenthesesPairs(numCount);
|
||||
if (pairs > 0) {
|
||||
expression = bracketManager.addParentheses(expression, pairs, numPositions);
|
||||
}
|
||||
}
|
||||
|
||||
if (!hasPower) {
|
||||
for (int i = 0; i < parts.length; i++) {
|
||||
if (parts[i].matches("\\d+")) {
|
||||
String op = POW_OPERATORS[RANDOM.nextInt(POW_OPERATORS.length)];
|
||||
parts[i] = op.equals("√") ? "√" + parts[i] : parts[i] + "^2";
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
// 添加幂运算并检查添加是否成功
|
||||
expression = powerManager.addPowerOperations(expression, numPositions);
|
||||
hasPower = expression.contains("^2") || expression.contains("√");
|
||||
} while (expressionBuilder.hasDivideByZero(expression) || !hasPower);
|
||||
|
||||
return String.join(" ", parts);
|
||||
return expression;
|
||||
}
|
||||
}
|
||||
@ -0,0 +1,95 @@
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
|
||||
/**
|
||||
* 负责添加幂运算
|
||||
*/
|
||||
public class PowerManager {
|
||||
private static final Random RANDOM = new Random();
|
||||
|
||||
// 普通幂运算
|
||||
public String addPowerOperations(String expression, List<Integer> numPositions) {
|
||||
if (numPositions.isEmpty()) return expression;
|
||||
|
||||
String[] tokens = expression.split(" ");
|
||||
int targetIndex = chooseTargetIndex(tokens, numPositions, null);
|
||||
|
||||
if (targetIndex != -1) {
|
||||
tokens[targetIndex] = applyPower(tokens[targetIndex], tokens, targetIndex);
|
||||
}
|
||||
|
||||
return String.join(" ", tokens);
|
||||
}
|
||||
|
||||
// 避免加在 trig 已占用的位置，同时避免加在运算符右边
|
||||
public String addPowerOperationsAvoid(String expression, List<Integer> numPositions, List<Integer> trigPositions) {
|
||||
if (numPositions.isEmpty()) return expression;
|
||||
|
||||
String[] tokens = expression.split(" ");
|
||||
int targetIndex = chooseTargetIndex(tokens, numPositions, trigPositions);
|
||||
|
||||
if (targetIndex != -1) {
|
||||
tokens[targetIndex] = applyPower(tokens[targetIndex], tokens, targetIndex);
|
||||
}
|
||||
|
||||
return String.join(" ", tokens);
|
||||
}
|
||||
|
||||
// 选择合适的位置加幂运算
|
||||
private int chooseTargetIndex(String[] tokens, List<Integer> numPositions, List<Integer> avoidPositions) {
|
||||
for (int tries = 0; tries < 20; tries++) {
|
||||
int idx = numPositions.get(RANDOM.nextInt(numPositions.size()));
|
||||
|
||||
if ((avoidPositions == null || !avoidPositions.contains(idx)) && canApplyPower(tokens, idx)) {
|
||||
return idx;
|
||||
}
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
// 检查该位置是否可以加幂运算
|
||||
private boolean canApplyPower(String[] tokens, int index) {
|
||||
if (!isNumber(tokens[index])) return false;
|
||||
if (tokens[index].contains("^") || tokens[index].contains("√")) return false; // 避免重复幂运算
|
||||
|
||||
// 不能加在运算符右边
|
||||
if (index > 0) {
|
||||
String prev = tokens[index - 1];
|
||||
if (prev.equals("/") || prev.equals("*") || prev.equals("+") || prev.equals("-")) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
// 应用平方或开方（根号放左括号左侧，平方放右括号右侧）
|
||||
private String applyPower(String token, String[] tokens, int index) {
|
||||
boolean useSqrt = RANDOM.nextBoolean();
|
||||
|
||||
if (useSqrt) {
|
||||
// 根号放在左括号左侧，如果前面是左括号，则放在括号左边
|
||||
if (index > 0 && tokens[index - 1].equals(")")) {
|
||||
return "√" + token; // 特殊情况，仍然放数字前
|
||||
}
|
||||
if (index > 0 && tokens[index - 1].equals("(")) {
|
||||
return "√" + token;
|
||||
}
|
||||
return "√" + token;
|
||||
} else {
|
||||
// 平方放在右括号右侧，如果后面是右括号，则放在括号右边
|
||||
if (index < tokens.length - 1 && tokens[index + 1].equals(")")) {
|
||||
return token + "^2";
|
||||
}
|
||||
return token + "^2";
|
||||
}
|
||||
}
|
||||
|
||||
private boolean isNumber(String token) {
|
||||
try {
|
||||
Integer.parseInt(token);
|
||||
return true;
|
||||
} catch (NumberFormatException e) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -1,44 +1,29 @@
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
|
||||
/**
|
||||
* 生成小学题目
|
||||
*/
|
||||
public class PrimaryProblem implements ProblemsGenerator {
|
||||
private static final Random RANDOM = new Random();
|
||||
private static final String[] OPERATORS = {"+", "-", "*", "/"};
|
||||
private final BracketManager bracketManager = new BracketManager();
|
||||
private final ExpressionBuilder expressionBuilder = new ExpressionBuilder();
|
||||
|
||||
@Override
|
||||
public String generate() {
|
||||
int count = RANDOM.nextInt(4) + 2;
|
||||
StringBuilder sb = new StringBuilder();
|
||||
String expression;
|
||||
do {
|
||||
int numCount = 2 + RANDOM.nextInt(4);
|
||||
expression = expressionBuilder.generateBasicExpression(numCount);
|
||||
|
||||
boolean addParentheses = count >= 3 && RANDOM.nextDouble() < 0.5;
|
||||
if (addParentheses) {
|
||||
int parenCount = RANDOM.nextInt(count - 2) + 2;
|
||||
int startPos = RANDOM.nextInt(count - parenCount + 1);
|
||||
|
||||
for (int i = 0; i < count; i++) {
|
||||
if (i == startPos) {
|
||||
sb.append("( ");
|
||||
List<Integer> numPositions = expressionBuilder.getNumberPositions(expression);
|
||||
int pairs = bracketManager.decideParenthesesPairs(numCount);
|
||||
if (pairs > 0) {
|
||||
expression = bracketManager.addParentheses(expression, pairs, numPositions);
|
||||
}
|
||||
|
||||
int num = RANDOM.nextInt(100) + 1;
|
||||
sb.append(num);
|
||||
|
||||
if (i == startPos + parenCount - 1) {
|
||||
sb.append(" )");
|
||||
}
|
||||
} while (expressionBuilder.hasDivideByZero(expression));
|
||||
|
||||
if (i < count - 1) {
|
||||
sb.append(" ").append(OPERATORS[RANDOM.nextInt(OPERATORS.length)]).append(" ");
|
||||
}
|
||||
}
|
||||
} else {
|
||||
for (int i = 0; i < count; i++) {
|
||||
int num = RANDOM.nextInt(100) + 1;
|
||||
sb.append(num);
|
||||
if (i < count - 1) {
|
||||
sb.append(" ").append(OPERATORS[RANDOM.nextInt(OPERATORS.length)]).append(" ");
|
||||
}
|
||||
}
|
||||
}
|
||||
return sb.toString();
|
||||
return expression;
|
||||
}
|
||||
}
|
||||
@ -1,107 +1,43 @@
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
|
||||
/**
|
||||
* 生成高中题目
|
||||
*/
|
||||
public class SeniorProblem implements ProblemsGenerator {
|
||||
private static final Random RANDOM = new Random();
|
||||
private static final String[] OPERATORS = {"+", "-", "*", "/"};
|
||||
private static final String[] POW_OPERATORS = {"√", "^2"};
|
||||
private static final String[] TRIG_OPERATORS = {"sin", "cos", "tan"};
|
||||
private final BracketManager bracketManager = new BracketManager();
|
||||
private final PowerManager powerManager = new PowerManager();
|
||||
private final TrigManager trigManager = new TrigManager();
|
||||
private final ExpressionBuilder expressionBuilder = new ExpressionBuilder();
|
||||
|
||||
@Override
|
||||
public String generate() {
|
||||
String primaryExpression = generatePrimaryExpression();
|
||||
String expression;
|
||||
boolean hasTrig;
|
||||
do {
|
||||
int numCount = RANDOM.nextInt(5) + 1;
|
||||
expression = expressionBuilder.generateBasicExpression(numCount);
|
||||
List<Integer> numPositions = expressionBuilder.getNumberPositions(expression);
|
||||
|
||||
return addHighSchoolOperators(primaryExpression);
|
||||
if (RANDOM.nextDouble() < 0.8) {
|
||||
int pairs = bracketManager.decideParenthesesPairs(numCount);
|
||||
if (pairs > 0) {
|
||||
expression = bracketManager.addParentheses(expression, pairs, numPositions);
|
||||
}
|
||||
|
||||
private String generatePrimaryExpression() {
|
||||
int count = RANDOM.nextInt(4) + 2;
|
||||
StringBuilder sb = new StringBuilder();
|
||||
|
||||
for (int i = 0; i < count; i++) {
|
||||
int num = RANDOM.nextInt(100) + 1;
|
||||
sb.append(num);
|
||||
if (i < count - 1) {
|
||||
sb.append(" ").append(OPERATORS[RANDOM.nextInt(OPERATORS.length)]).append(" ");
|
||||
}
|
||||
}
|
||||
return sb.toString();
|
||||
}
|
||||
|
||||
private String addHighSchoolOperators(String primaryExpression) {
|
||||
String[] parts = primaryExpression.split(" ");
|
||||
StringBuilder result = new StringBuilder();
|
||||
boolean hasTrigonometry = false;
|
||||
boolean hasAlgebra = false;
|
||||
// 添加三角函数并检查是否存在
|
||||
expression = trigManager.addTrigOperations(expression, numPositions);
|
||||
List<Integer> trigPositions = expressionBuilder.getNumberPositions(expression);
|
||||
hasTrig = expression.contains("sin") || expression.contains("cos") || expression.contains("tan");
|
||||
|
||||
for (int i = 0; i < parts.length; i++) {
|
||||
String part = parts[i];
|
||||
|
||||
if (isNumber(part)) {
|
||||
if (!hasTrigonometry || RANDOM.nextDouble() < 0.6) {
|
||||
part = applyTrigOperator(part);
|
||||
hasTrigonometry = true;
|
||||
}
|
||||
else if (RANDOM.nextDouble() < 0.3) {
|
||||
part = applyAlgebraOperator(part);
|
||||
hasAlgebra = true;
|
||||
}
|
||||
}
|
||||
|
||||
result.append(part);
|
||||
if (i < parts.length - 1) {
|
||||
result.append(" ");
|
||||
}
|
||||
}
|
||||
|
||||
if (!hasTrigonometry) {
|
||||
return addTrigonometryForced(result.toString());
|
||||
}
|
||||
|
||||
return result.toString();
|
||||
}
|
||||
|
||||
private boolean isNumber(String str) {
|
||||
try {
|
||||
Integer.parseInt(str);
|
||||
return true;
|
||||
} catch (NumberFormatException e) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
private String applyTrigOperator(String number) {
|
||||
String operator = TRIG_OPERATORS[RANDOM.nextInt(TRIG_OPERATORS.length)];
|
||||
int num = Integer.parseInt(number);
|
||||
int angle = generateValidAngle(operator);
|
||||
return operator + angle + "°";
|
||||
}
|
||||
|
||||
private String applyAlgebraOperator(String number) {
|
||||
String operator = POW_OPERATORS[RANDOM.nextInt(POW_OPERATORS.length)];
|
||||
int num = Integer.parseInt(number);
|
||||
return operator.equals("√") ? "√" + num : num + "^2";
|
||||
}
|
||||
|
||||
private int generateValidAngle(String trigOp) {
|
||||
int angle = RANDOM.nextInt(100) + 1;
|
||||
if (trigOp.equals("tan")) {
|
||||
while (angle == 90) {
|
||||
angle = RANDOM.nextInt(100) + 1;
|
||||
}
|
||||
}
|
||||
return angle;
|
||||
}
|
||||
|
||||
private String addTrigonometryForced(String expression) {
|
||||
String[] parts = expression.split(" ");
|
||||
|
||||
for (int i = 0; i < parts.length; i++) {
|
||||
if (isNumber(parts[i])) {
|
||||
parts[i] = applyTrigOperator(parts[i]);
|
||||
break;
|
||||
}
|
||||
// 40% 概率加幂运算，避免与 trig 重叠
|
||||
if (RANDOM.nextDouble() < 0.4) {
|
||||
expression = powerManager.addPowerOperationsAvoid(expression, numPositions, trigPositions);
|
||||
}
|
||||
} while (expressionBuilder.hasDivideByZero(expression) || !hasTrig);
|
||||
|
||||
return String.join(" ", parts);
|
||||
return expression;
|
||||
}
|
||||
}
|
||||
@ -0,0 +1,70 @@
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
|
||||
/**
|
||||
* 负责添加三角函数
|
||||
*/
|
||||
public class TrigManager {
|
||||
private static final Random RANDOM = new Random();
|
||||
private static final String[] TRIG_FUNCTIONS = {"sin", "cos", "tan"};
|
||||
|
||||
//添加三角函数
|
||||
public String addTrigOperations(String expression, List<Integer> numPositions) {
|
||||
if (numPositions.isEmpty()) {
|
||||
return expression;
|
||||
}
|
||||
|
||||
String[] tokens = expression.split(" ");
|
||||
int targetIndex = chooseTargetIndex(numPositions, tokens);
|
||||
if (targetIndex == -1) {
|
||||
return expression;
|
||||
}
|
||||
|
||||
tokens[targetIndex] = applyTrig(tokens[targetIndex]);
|
||||
return String.join(" ", tokens);
|
||||
}
|
||||
|
||||
//随机函数种类
|
||||
private int chooseTargetIndex(List<Integer> numPositions, String[] tokens) {
|
||||
for (int tries = 0; tries < 50; tries++) {
|
||||
int idx = numPositions.get(RANDOM.nextInt(numPositions.size()));
|
||||
if (canApplyTrig(tokens, idx)) {
|
||||
return idx;
|
||||
}
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
//检测三角函数是否合法
|
||||
private boolean canApplyTrig(String[] tokens, int index) {
|
||||
if (!isNumber(tokens[index])) {
|
||||
return false;
|
||||
}
|
||||
int value = Integer.parseInt(tokens[index]);
|
||||
|
||||
// 防止 tan(90)
|
||||
if (value == 90 && RANDOM.nextInt(3) == 2) {
|
||||
return false;
|
||||
}
|
||||
// cos(90) 不加在除法右边
|
||||
if (index > 0 && tokens[index - 1].equals("/") && value == 90) {
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
//添加操作
|
||||
private String applyTrig(String token) {
|
||||
String func = TRIG_FUNCTIONS[RANDOM.nextInt(TRIG_FUNCTIONS.length)];
|
||||
return func + "(" + token + ")";
|
||||
}
|
||||
|
||||
private boolean isNumber(String token) {
|
||||
try {
|
||||
Integer.parseInt(token);
|
||||
return true;
|
||||
} catch (NumberFormatException e) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
}
|
||||
Loading…
Reference in new issue