solves k weakest rows in a matrix

Author: anishLearnsToCode

README.md

@@ -342,7 +342,7 @@
 | 1323 | [Maximum 69 Number](https://leetcode.com/problems/maximum-69-number)                                                                                 |                                                                 [![Java](assets/java.png)](src/Maximum69Number.java)                                                                 |                                                                                                                                   |
 | 1331 | [Rank Transform of An Array](https://leetcode.com/problems/rank-transform-of-an-array)                                                               |                                                              [![Java](assets/java.png)](src/RankTransformOfArray.java)                                                               |                                                                                                                                   |
 | 1332 | [Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences)                                                     |                                                          [![Java](assets/java.png)](src/RemovePalindromicSubSequences.java)                                                          |                                                                                                                                   |
-| 1337 | [The K Weakest Rows In A Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix)                                                       |                                                                                                                                                                                      |                                                                                                                                   |
+| 1337 | [The K Weakest Rows In A Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix)                                                       |                                                            [![Java](assets/java.png)](src/TheKWeakestRowsInAMatrix.java)                                                             |                                                                                                                                   |
 | 1342 | [Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero)                               |                                                                                                                                                                                      |                                                                                                                                   |
 | 1346 | [Check if N and It's Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist)                                                    |                                                                                                                                                                                      |                                                                                                                                   |
 | 1351 | [Count Negative Numbers In A Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix)                                 |                                                                                                                                                                                      |                                                                                                                                   |

src/TheKWeakestRowsInAMatrix.java

@@ -3,13 +3,25 @@
 
 public class TheKWeakestRowsInAMatrix {
     public int[] kWeakestRows(int[][] mat, int k) {
-        Queue<Row> minHeap = new PriorityQueue<>();
-        for (int[] row: mat) {
-            minHeap.add()
+        final Queue<Row> minHeap = new PriorityQueue<>();
+        for (int index = 0 ; index < mat.length ; index++) {
+            minHeap.add(Row.from(mat[index], index));
         }
+        final int[] result = new int[k];
+        for (int i = 0 ; i < result.length ; i++) {
+            result[i] = minHeap.poll().index;
+        }
+        return result;
     }
 
-    private record Row(int index, int soldiers) implements Comparable<Row> {
+    private static final class Row implements Comparable<Row> {
+        private final int index;
+        private final int soldiers;
+
+        private Row(int index, int soldiers) {
+            this.index = index;
+            this.soldiers = soldiers;
+        }
 
         @Override
         public int compareTo(Row other) {
@@ -20,7 +32,11 @@ public int compareTo(Row other) {
         }
 
         private static Row from(int[] row, int index) {
-            for (int)
+            int soldiers = 0;
+            for (int i = 0; i < row.length && row[i] == 1; i++) {
+                soldiers++;
+            }
+            return new Row(index, soldiers);
         }
     }
 }