add 1727

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1727|[Largest Submatrix With Rearrangements](https://leetcode.com/problems/largest-submatrix-with-rearrangements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1727.java) ||Medium|Greedy, Sort|
 |1726|[Tuple with Same Product](https://leetcode.com/problems/tuple-with-same-product/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1726.java) ||Medium|Array|
 |1725|[Number Of Rectangles That Can Form The Largest Square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1725.java) ||Easy|Greedy|
 |1721|[Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1721.java) ||Medium|LinkedList|

src/main/java/com/fishercoder/solutions/_1727.java

@@ -0,0 +1,30 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _1727 {
+    public static class Solution1 {
+        /**
+         * credit: https://leetcode.com/problems/largest-submatrix-with-rearrangements/discuss/1020682/Java-or-6ms-or-easy-understanding-with-comments-and-images
+         */
+        public int largestSubmatrix(int[][] matrix) {
+            int m = matrix.length;
+            int n = matrix[0].length;
+            for (int i = 1; i < m; i++) {
+                for (int j = 0; j < n; j++) {
+                    if (matrix[i][j] != 0) {
+                        matrix[i][j] = matrix[i - 1][j] + 1;
+                    }
+                }
+            }
+            int count = 0;
+            for (int i = 0; i < m; i++) {
+                Arrays.sort(matrix[i]);
+                for (int j = 1; j <= n; j++) {
+                    count = Math.max(count, j * matrix[i][n - j]);
+                }
+            }
+            return count;
+        }
+    }
+}

src/test/java/com/fishercoder/_1727Test.java

@@ -0,0 +1,26 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._1;
+import com.fishercoder.solutions._1727;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+import static org.junit.Assert.assertEquals;
+
+public class _1727Test {
+    private static _1727.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1727.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(8, solution1.largestSubmatrix(
+                CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[0,1,1,1,1,1,1],[1,1,0,1,1,0,1],[1,0,0,1,0,1,1]")));
+    }
+
+}