feat: update solutions to lc problem: No.1072

No.1072.Flip Columns For Maximum Number of Equal Rows

Author: yanglbme

solution/1000-1099/1072.Flip Columns For Maximum Number of Equal Rows/README.md

@@ -97,13 +97,13 @@ class Solution:
 class Solution {
     public int maxEqualRowsAfterFlips(int[][] matrix) {
         Map<String, Integer> cnt = new HashMap<>();
-        int ans = 0;
+        int ans = 0, n = matrix[0].length;
         for (var row : matrix) {
-            var sb = new StringBuilder();
-            for (int x : row) {
-                sb.append(row[0] == 0 ? x : x ^ 1);
+            char[] cs = new char[n];
+            for (int i = 0; i < n; ++i) {
+                cs[i] = (char) (row[0] ^ row[i]);
             }
-            ans = Math.max(ans, cnt.merge(sb.toString(), 1, Integer::sum));
+            ans = Math.max(ans, cnt.merge(String.valueOf(cs), 1, Integer::sum));
         }
         return ans;
     }

solution/1000-1099/1072.Flip Columns For Maximum Number of Equal Rows/README_EN.md

@@ -67,13 +67,13 @@ class Solution:
 class Solution {
     public int maxEqualRowsAfterFlips(int[][] matrix) {
         Map<String, Integer> cnt = new HashMap<>();
-        int ans = 0;
+        int ans = 0, n = matrix[0].length;
         for (var row : matrix) {
-            var sb = new StringBuilder();
-            for (int x : row) {
-                sb.append(row[0] == 0 ? x : x ^ 1);
+            char[] cs = new char[n];
+            for (int i = 0; i < n; ++i) {
+                cs[i] = (char) (row[0] ^ row[i]);
             }
-            ans = Math.max(ans, cnt.merge(sb.toString(), 1, Integer::sum));
+            ans = Math.max(ans, cnt.merge(String.valueOf(cs), 1, Integer::sum));
         }
         return ans;
     }

solution/1000-1099/1072.Flip Columns For Maximum Number of Equal Rows/Solution.java

@@ -1,13 +1,13 @@
 class Solution {
     public int maxEqualRowsAfterFlips(int[][] matrix) {
         Map<String, Integer> cnt = new HashMap<>();
-        int ans = 0;
+        int ans = 0, n = matrix[0].length;
         for (var row : matrix) {
-            var sb = new StringBuilder();
-            for (int x : row) {
-                sb.append(row[0] == 0 ? x : x ^ 1);
+            char[] cs = new char[n];
+            for (int i = 0; i < n; ++i) {
+                cs[i] = (char) (row[0] ^ row[i]);
             }
-            ans = Math.max(ans, cnt.merge(sb.toString(), 1, Integer::sum));
+            ans = Math.max(ans, cnt.merge(String.valueOf(cs), 1, Integer::sum));
         }
         return ans;
     }

solution/main.py

@@ -391,7 +391,7 @@ def get_contests(fetch_new=True) -> List:
 generate_summary(ls)
 
 # 生成周赛题目列表
-# generate_contest_readme(cls)
+generate_contest_readme(cls)
 
 # 刷新题目文件
 if refresh_all: