1672. Richest Customer Wealth

package LeetCode_1672

/**
 * 1672. Richest Customer Wealth
 * https://leetcode.com/problems/richest-customer-wealth/submissions/
 * 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.
 * */
class Solution {
    /*
    * solution: bruce force, Time:O(mn), Space:O(1)
    * */
    fun maximumWealth(accounts: Array<IntArray>): Int {
        if (accounts == null || accounts.isEmpty()) {
            return 0
        }
        val m = accounts.size
        val n = accounts[0].size
        var result = 0
        for (i in 0 until m) {
            var current = 0
            for (j in 0 until n) {
                current += accounts[i][j]
            }
            result = Math.max(result, current)
        }
        return result
    }
}