package leetcode;

/**
 * https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows/
 */
public class Problem1072 {
    public int maxEqualRowsAfterFlips(int[][] matrix) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem1072 prob = new Problem1072();
        System.out.println(prob.maxEqualRowsAfterFlips(new int[][]{
            {0, 1},
            {1, 1}
        })); // 1
        System.out.println(prob.maxEqualRowsAfterFlips(new int[][]{
            {0, 1},
            {1, 0}
        })); // 2
        System.out.println(prob.maxEqualRowsAfterFlips(new int[][]{
            {0, 0, 0},
            {0, 0, 1},
            {1, 1, 0}
        })); // 2
    }
}

@@ -199,16 +199,147 @@
 // TODO%0A
+        for (int i = 0; i %3C matrix.length; i++) %7B%0A            for (int j = 0; j %3C matrix%5Bi%5D.length; j++) %7B%0A            %7D%0A        %7D%0A
         
@@ -846,20 +846,197 @@
   %7D)); // 2%0A
+        System.out.println(prob.maxEqualRowsAfterFlips(new int%5B%5D%5B%5D%7B%0A            %7B0, 0, 0%7D,%0A            %7B0, 0, 1%7D,%0A            %7B1, 0, 1%7D,%0A            %7B1, 1, 0%7D%0A        %7D)); // 2%0A
     %7D%0A%7D%0A

Update problem 1072