1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
| class Solution {
public int matrixSum(int[][] nums) {
int m = nums.length, n = nums[0].length;
List<Queue<Integer>> queueList = new ArrayList<>(nums.length);
for (int[] array : nums) {
Queue<Integer> queue = new PriorityQueue<>();
for (int num : array) {
queue.offer(num);
}
queueList.add(queue);
}
int sum = 0;
for (int i = 0; i < n; i++) {
int max = 0;
for (Queue<Integer> queue : queueList) {
max = Math.max(max, queue.poll());
}
sum += max;
}
return sum;
}
}
|