[LeetCode] 1672. Richest Customer Wealth c++

• 문제

You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the i​​​​​​​​​​​th​​​​ customer has in the j​​​​​​​​​​​th​​​​ bank. Return the wealth that the richest customer has.

A customer's wealth is the amount of money they have in all their bank accounts. The richest customer is the customer that has the maximum wealth.

Input: accounts = [[1,2,3],[3,2,1]]
Output: 6
Explanation:
1st customer has wealth = 1 + 2 + 3 = 6
2nd customer has wealth = 3 + 2 + 1 = 6
Both customers are considered the richest with a wealth of 6 each, so return 6.

각 벡터들 원소 합의 최대값을 구하는 문제이다.

 

• 문제 해결

class Solution {
public:
    int maximumWealth(vector<vector<int>>& accounts) {
        
        int result(0), sum(0);
        for(const auto& it : accounts){
            sum = accumulate(it.begin(), it.end(), 0);
            result = max(result, sum);
        }
        return result;
    }
};