[JS] 1672. Richest Customer Wealth

이차원 배열의 연산 문제

map 과 reduce 를 사용해서 풀어보았다

https://leetcode.com/problems/richest-customer-wealth/

Richest Customer Wealth - LeetCode

/**
 * @param {number[][]} accounts
 * @return {number}
 */
var maximumWealth = function (accounts) {
  const wealths = accounts.map((el) =>
    el.reduce(
      (base,plus) => {
        return (base += plus);
      },
      0)
    );
  return Math.max(...wealths);
};