We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 60634fc commit c70ecd3Copy full SHA for c70ecd3
src/main/java/g2701_2800/s2732_find_a_good_subset_of_the_matrix/Solution.java
@@ -35,7 +35,8 @@ public List<Integer> goodSubsetofBinaryMatrix(int[][] grid) {
35
}
36
37
private int get(int[] nums) {
38
- int n = nums.length, rs = 0;
+ int n = nums.length;
39
+ int rs = 0;
40
for (int i = 0; i < n; ++i) {
41
if (nums[i] == 1) {
42
rs = (rs | (1 << i));
0 commit comments