[Easy] 1672. Richest Customer Wealth

문제

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.

 

고객이 은행 에 가지고 있는 금액은 m x n정수 그리드 accounts가 제공 됩니다. 가장 부유한 고객이 가지고 있는 부를 반환 하십시오.

고객의 부는 모든 은행 계좌에 있는 금액입니다. 가장 부유한 고객은 최대의 부를 가진 고객입니다 .

예시

Example 1:

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.

Example 2:

Input: accounts = [[1,5],[7,3],[3,5]]
Output: 10
Explanation: 
1st customer has wealth = 6
2nd customer has wealth = 10 
3rd customer has wealth = 8
The 2nd customer is the richest with a wealth of 10.

Example 3:

Input: accounts = [[2,8,7],[7,1,3],[1,9,5]]
Output: 17

 

제약 조건

Constraints:

• m == accounts.length
• n == accounts[i].length
• 1 <= m, n <= 50
• 1 <= accounts[i][j] <= 100

 

풀이 과정

• 최대 부를 저장할 max 변수를 초기화한다.
• for문을 돌면서 accounts를 전체 순회한다.
  • sum 변수에 accunts[i] 총합을 넣는다.
  • 만약 sum이 max보다 크다면 max에 sum 값을 할당한다.
• for문을 빠져나오면 max값을 반환한다.

풀이 코드

/**
 * @param {number[][]} accounts
 * @return {number}
 */
var maximumWealth = function(accounts) {
    let max = 0;
    for(let i = 0 ; i < accounts.length ; i++){
        let sum = accounts[i].reduce((acc, curr) => acc += curr, 0);
        if(max < sum) max = sum;
    }
    return max;
};