The K Weakest Rows in a Matrix
You are given an m x n binary matrix mat of 1's representing soldiers and 0's representing civilians. The soldiers are positioned in front of the civilians, meaning all the 1's appear to the left of all the 0's in each row.
A row i is weaker than a row j if one of the following is true:
- The number of soldiers in row
iis less than the number of soldiers in rowj. - Both rows have the same number of soldiers and
i < j.
Return the indices of the k weakest rows in the matrix ordered from weakest to strongest.
Example 1
1 1 0 0 0 1 1 1 1 0 1 0 0 0 0 1 1 0 0 0 1 1 1 1 1
Input
mat = [[1,1,0,0,0],[1,1,1,1,0],[1,0,0,0,0],[1,1,0,0,0],[1,1,1,1,1]], k = 3Output
[2,0,3]The rows ordered from weakest to strongest are [2, 0, 3, 1, 4], so the first 3 are [2, 0, 3].
Example 2
1 0 0 0 1 1 1 1 1 0 0 0 1 0 0 0
Input
mat = [[1,0,0,0],[1,1,1,1],[1,0,0,0],[1,0,0,0]], k = 2Output
[0,2]The rows ordered from weakest to strongest are [0, 2, 3, 1], so the first 2 are [0, 2].
Constraints
- m == mat.length
- n == mat[i].length
- 2 <= n, m <= 100
- 1 <= k <= m
- matrix[i][j] is either 0 or 1.