📅  最后修改于: 2022-03-11 14:52:09.648000             🧑  作者: Mango
class Solution {
public int maximumWealth(int[][] accounts) {
int max = 0;
for (int[] account : accounts) {
int sum = 0;
for (int i : account) {
sum += i;
if (sum > max) max = sum;
}
}
return max;
}
}