Class Solution
java.lang.Object
g2701_2800.s2732_find_a_good_subset_of_the_matrix.Solution
2732 - Find a Good Subset of the Matrix.<p>Hard</p>
<p>You are given a <strong>0-indexed</strong> <code>m x n</code> binary matrix <code>grid</code>.</p>
<p>Let us call a <strong>non-empty</strong> subset of rows <strong>good</strong> if the sum of each column of the subset is at most half of the length of the subset.</p>
<p>More formally, if the length of the chosen subset of rows is <code>k</code>, then the sum of each column should be at most <code>floor(k / 2)</code>.</p>
<p>Return <em>an integer array that contains row indices of a good subset sorted in <strong>ascending</strong> order.</em></p>
<p>If there are multiple good subsets, you can return any of them. If there are no good subsets, return an empty array.</p>
<p>A <strong>subset</strong> of rows of the matrix <code>grid</code> is any matrix that can be obtained by deleting some (possibly none or all) rows from <code>grid</code>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> grid = [[0,1,1,0],[0,0,0,1],[1,1,1,1]]</p>
<p><strong>Output:</strong> [0,1]</p>
<p><strong>Explanation:</strong> We can choose the 0<sup>th</sup> and 1<sup>st</sup> rows to create a good subset of rows. The length of the chosen subset is 2.</p>
<ul>
<li>The sum of the 0<sup>th</sup> column is 0 + 0 = 0, which is at most half of the length of the subset.</li>
<li>The sum of the 1<sup>st</sup> column is 1 + 0 = 1, which is at most half of the length of the subset.</li>
<li>The sum of the 2<sup>nd</sup> column is 1 + 0 = 1, which is at most half of the length of the subset.</li>
<li>The sum of the 3<sup>rd</sup> column is 0 + 1 = 1, which is at most half of the length of the subset.</li>
</ul>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> grid = [[0]]</p>
<p><strong>Output:</strong> [0]</p>
<p><strong>Explanation:</strong> We can choose the 0<sup>th</sup> row to create a good subset of rows. The length of the chosen subset is 1.</p>
<ul>
<li>The sum of the 0<sup>th</sup> column is 0, which is at most half of the length of the subset.</li>
</ul>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> grid = [[1,1,1],[1,1,1]]</p>
<p><strong>Output:</strong> []</p>
<p><strong>Explanation:</strong> It is impossible to choose any subset of rows to create a good subset.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>m == grid.length</code></li>
<li><code>n == grid[i].length</code></li>
<li><code>1 <= m <= 10<sup>4</sup></code></li>
<li><code>1 <= n <= 5</code></li>
<li><code>grid[i][j]</code> is either <code>0</code> or <code>1</code>.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
goodSubsetofBinaryMatrix
-