class Solution {
public int maximumWealth(int[][] accounts) {
int max = 0;
for(int i =0; i< accounts.length; i++) {
int x = 0;
for(int j = 0; j < accounts[i].length; j++) {
x += accounts[i][j];
if(x >= max)
max = x;
}
}
return max;
}
}
LeetCode 1672最富有客户的资产总量(java)
最新推荐文章于 2022-01-05 04:26:21 发布