image_2021-11-01_03-24-50.png
49.5 KB
#N1337. The K Weakest Rows in a Matrix
problem link=>https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/
#solution
problem link=>https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/
#solution
class Solution {
public int[] kWeakestRows(int[][] mat, int k) {
int[] soldiers=new int[mat.length];
int rows=mat.length;
int sum=0;
int[] ans=new int[k];
for(int i=0; i<rows; i++){
for(int j=0; j<mat[i].length; j++){
sum+=mat[i][j];
}
soldiers[i]=sum*rows+i;
sum=0;
}
Arrays.sort(soldiers);
int min=0;
for(int i=0; i<k; i++)
ans[i]=soldiers[i]%rows;
return ans;
}
}