CodeSprout 官方2026/10/04 00:19

官方解答 · 置頂Java

官方解答｜分類讀值總和

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

import java.util.*;

public class Solution {
    private static int aggregate(List<Integer> values) {
        int answer = 0;
        for (int x : values) answer += x;
        return answer;
    }

    public static List<Integer> solve(int[] nums) {
        Map<Integer,List<Integer>> groups = new TreeMap<>();
        for (int x : nums) {
            if (true) {
                int key = Math.floorMod(x,3);
                groups.computeIfAbsent(key, ignored -> new ArrayList<>()).add(x);
            }
        }
        List<Integer> result = new ArrayList<>();
        for (Map.Entry<Integer,List<Integer>> entry : groups.entrySet()) {
            result.add(entry.getKey()); result.add(aggregate(entry.getValue()));
        }
        return result;
    }
}