题目链接:https://leetcode-cn.com/problems/richest-customer-wealth/
题目如下:
class Solution {
public:
int maximumWealth(vector<vector<int>>& accounts) {
//accumulate函数可以求和、练乘、求string拼接,包含的头文件为#include<numeric>
int res=0;
for(auto e:accounts){
res=max(res,accumulate(e.begin(),e.end(),0));
}
return res;
}
};