Leetcode/3546. Equal Sum Grid Partition I/Solution.cs

public class Solution
{
    struct SumInfo
    {
        public long Left;
        public long Right;
        public long Value;
    }

    public bool CanPartitionGrid(int[][] grid)
    {
        var height = grid.Length;
        var width = grid[0].Length;

        var colSums = new SumInfo[width];
        var rowSums = new SumInfo[height];
        for (var i = 0; i < height; i++)
        {
            for (var j = 0; j < grid[i].Length; j++)
            {
                colSums[j].Value += grid[i][j];
                rowSums[i].Value += grid[i][j];

            }
            rowSums[i].Left = rowSums[i].Value;
            if (i > 0)
                rowSums[i].Left += rowSums[i - 1].Left;
        }
        for (var i = height - 1; i >= 0; i--)
        {
            rowSums[i].Right = rowSums[i].Value;
            if (i < height - 1)
                rowSums[i].Right += rowSums[i + 1].Right;
        }
        for (var j = 0; j < width; j++)
        {
            colSums[j].Left = colSums[j].Value;
            if (j > 0)
                colSums[j].Left += colSums[j - 1].Left;
        }
        for (var j = width - 1; j >= 0; j--)
        {
            colSums[j].Right = colSums[j].Value;
            if (j < width - 1)
                colSums[j].Right += colSums[j + 1].Right;
        }
        return rowSums.Any(row => Math.Abs(row.Left - row.Right) == row.Value) || colSums.Any(col => Math.Abs(col.Left - col.Right) == col.Value);
    }
}