CodeSprout 官方2026/10/04 00:19

官方解答 · 置頂Java

官方解答｜策略讀值總和

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

import java.util.*;

public class Solution {
    private interface Rule { int apply(int x); }
    private static class MatchRule implements Rule {
        public int apply(int x) { return x; }
    }
    private static class OtherRule implements Rule {
        public int apply(int x) { return -x; }
    }
    private static int aggregate(List<Integer> values) {
        int answer = 0;
        for (int x : values) answer += x;
        return answer;
    }

    public static int solve(int[] nums) {
        Rule matchRule = new MatchRule(), otherRule = new OtherRule();
        List<Integer> values = new ArrayList<>();
        for (int x : nums) {
            Rule rule = (x % 2 == 0) ? matchRule : otherRule;
            values.add(rule.apply(x));
        }
        return aggregate(values);
    }
}