g1701_1800.s1727_largest_submatrix_with_rearrangements.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g1701_1800.s1727_largest_submatrix_with_rearrangements;
// #Medium #Array #Sorting #Greedy #Matrix #2022_04_28_Time_9_ms_(90.48%)_Space_67.7_MB_(91.27%)
import java.util.Arrays;
public class Solution {
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[] ints : matrix) {
Arrays.sort(ints);
for (int j = 1; j <= n; j++) {
count = Math.max(count, j * ints[n - j]);
}
}
return count;
}
}