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
    }
}

@@ -406,16 +406,28 @@
  1%7D,
+%0A           
  %7B1, 1%7D%0A
     
@@ -422,16 +422,16 @@
  %7B1, 1%7D%0A
-
         
@@ -523,24 +523,36 @@
      %7B0, 1%7D,
+%0A           
  %7B1, 0%7D%0A    
@@ -659,19 +659,43 @@
  0%7D,
- %7B0, 0, 1%7D,
+%0A            %7B0, 0, 1%7D,%0A           
  %7B1,

Update problem 1072