1672_RichestCustomerWealth - a920604a/leetcode GitHub Wiki

class Solution {
public:
    int maximumWealth(vector<vector<int>>& accounts) {
        int mx = 0, n= accounts.size();
        for(int i=0;i<n;++i){
            int temp = 0;
            for(auto a:accounts[i]) temp+=a;
            mx = max(mx, temp);
        }
        return mx;
    }
};