1672.richest-customer-wealth.ts

// @lc code=start
function maximumWealth(accounts: number[][]): number {
	let result = 0;

	for (const account of accounts) {
		const sum = account.reduce((a, b) => a + b, 0);
		if (sum > result) {
			result = sum;
		}
	}

	return result;
}
// @lc code=end

console.log(
	maximumWealth([
		[1, 2, 3],
		[3, 2, 1],
	])
); // 6
console.log(
	maximumWealth([
		[1, 5],
		[7, 3],
		[3, 5],
	])
); // 10
console.log(
	maximumWealth([
		[2, 8, 7],
		[7, 1, 3],
		[1, 9, 5],
	])
); // 17
console.log(
	maximumWealth([
		[2, 6, 3],
		[1, 2, 5],
		[1, 3, 3],
	])
); // 10
console.log(
	maximumWealth([
		[2, 3, 4],
		[4, 3, 2],
		[1, 2, 5],
	])
); // 10

/*
 * @lc app=leetcode id=1672 lang=typescript
 *
 * [1672] Richest Customer Wealth
 *
 * https://leetcode.com/problems/richest-customer-wealth/description/
 *
 * algorithms
 * Easy (88.54%)
 * Likes:    4589
 * Dislikes: 375
 * Total Accepted:    1.1M
 * Total Submissions: 1.2M
 * Testcase Example:  '[[1,2,3],[3,2,1]]'
 *
 * 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.
 *
 *
 * 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
 *
 *
 */