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

/*
 * The problem requires finding the minimum number of flips (either row or column) to convert a binary matrix such that all elements are 0s.
 * A flip changes all 1s to 0s and 0s to 1s in the flipped row or column.
 * Using Java Streams, we can count the number of 1s in each row and column and choose the maximum count to determine the minimum flips needed.
 */
import java.util.stream.*;

public class Solution {
    public int minFlips(int[][] matrix) {
        int rows = matrix.length;
        int cols = matrix[0].length;

        int maxRowOnes = IntStream.range(0, rows)
            .map(i -> (int) IntStream.range(0, cols).filter(j -> matrix[i][j] == 1).count())
            .max()
            .orElse(0);

        int maxColOnes = IntStream.range(0, cols)
            .map(j -> (int) IntStream.range(0, rows).filter(i -> matrix[i][j] == 1).count())
            .max()
            .orElse(0);

        return Math.max(maxRowOnes, maxColOnes);
    }
}