g1601_1700.s1672_richest_customer_wealth.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g1601_1700.s1672_richest_customer_wealth;

// #Easy #Array #Matrix #Programming_Skills_I_Day_6_Array
// #2022_04_23_Time_0_ms_(100.00%)_Space_44.1_MB_(7.31%)

/**
 * 1672 - Richest Customer Wealth\.
 *
 * Easy
 *
 * 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`
**/
public class Solution {
    public int maximumWealth(int[][] accounts) {
        int max = Integer.MIN_VALUE;
        for (int[] account : accounts) {
            int sum = 0;
            for (int i : account) {
                sum += i;
            }
            max = Math.max(max, sum);
        }
        return max;
    }
}