通过翻转行或列来去除所有的 1

/*
 * Problem: LeetCode 2128 - Remove All 1's With Row and Column Flips
 *
 * Approach:
 * 1. This approach uses Java Streams to determine if the grid can be flipped to remove all 1's.
 * 2. The same logic applies: check if each row matches the first row or its complement.
 */

import java.util.Arrays;

public class Solution {
    public boolean removeOnes(int[][] grid) {
        int[] firstRow = grid[0];
        return Arrays.stream(grid)
            .allMatch(row -> matchesOrComplement(firstRow, row));
    }

    private boolean matchesOrComplement(int[] row1, int[] row2) {
        return Arrays.equals(row1, row2) ||
               Arrays.equals(row1, Arrays.stream(row2).map(val -> val == 0 ? 1 : 0).toArray());
    }
}