class Solution {
public:
int maximumWealth(vector<vector<int>>& accounts) {
int m = 0;
for(auto v:accounts)
{
int sum = 0;
for(auto j:v)
{
sum += j;
}
m = max(m,sum);
}
return m;
}
};
leetcode每日一题第101天
最新推荐文章于 2024-08-21 19:42:53 发布