CodeSprout 官方2026/10/04 00:19

官方解答 · 置頂Java

官方解答｜算式最高結果

CodeSprout 官方解答 · 題意分析、解題步驟與完整參考程式

import java.util.*;

public class Solution {
    private static int aggregate(List<Integer> values) {
        if (values.isEmpty()) return 0;
        int answer = values.get(0);
        for (int x : values) answer = Math.max(answer, x);
        return answer;
    }

    public static List<Integer> solve(String[] records) {
        List<Integer> result = new ArrayList<>();
        for (String record : records) {
            String[] parts = record.trim().split(" +");
            int a = Integer.parseInt(parts[0]);
            int b = Integer.parseInt(parts[2]);
            int c = Integer.parseInt(parts[4]);
            String left = parts[1], right = parts[3];
            int x;
            int tail = right.equals("*") ? b*c : right.equals("+") ? b+c : b-c;
            x = left.equals("*") ? a*tail : left.equals("+") ? a+tail : a-tail;
            result.add(x);
        }
        return Arrays.asList(aggregate(result));
    }
}