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.min(answer, x);
        return answer;
    }

    public static int solve(int[] left, int[] right) {
        Set<Integer> values = new HashSet<>(), rightSet = new HashSet<>();
        for (int x : left) values.add(x);
        for (int x : right) rightSet.add(x);
        for (int x : rightSet) { if (!values.add(x)) values.remove(x); }
        List<Integer> result = new ArrayList<>();
        for (int x : values) if (x % 2 == 0) result.add(x);
        return aggregate(result);
    }
}