1
class Solution {
2
public int maximumWealth(int[][] accounts) {
3
int res = 0;
4
for (int i = 0; i < accounts.length; i++) {
5
int temp = 0;
6
for (int j = 0; j < accounts[i].length; j++) {
7
temp += accounts[i][j];
8
}
9
res = Math.max(res, temp);
10
}
11
return res;
12
}
13
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0