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[][] grid) {
        List<Integer> result = new ArrayList<>();
        int columns = grid.length == 0 ? 0 : grid[0].length;
        for (int col = 0; col < columns; col++) {
            List<Integer> values = new ArrayList<>();
            for (int row = 0; row < grid.length; row++) {
                int x = grid[row][col];
                if (x % 2 != 0) values.add(-x);
            }
            result.add(aggregate(values));
        }
        return result;
    }
}