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 i = 0; i < values.size(); i++)
            answer += (i % 2 == 0 ? values.get(i) : -values.get(i));
        return answer;
    }

    public static List<Integer> solve(int[] nums) {
        List<Integer> result = new ArrayList<>();
        for (int end = 5; end <= nums.length; end++) {
            List<Integer> values = new ArrayList<>();
            for (int i = 0; i < end; i++) {
                int x = nums[i];
                if (x != 0) values.add(x);
            }
            result.add(aggregate(values));
        }
        return result;
    }
}