Richest Customer Wealth

You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the i​​​​​<sup>​​​​​​th</sup>​​​​ customer has in the j​​​​​<sup>​​​​​​th</sup>​​​​ 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.

LeetCode Problem - 1672

class Solution {
    public int maximumWealth(int[][] accounts) {
        // Initialize a variable 'maxVal' to keep track of the maximum wealth found.
        int maxVal = 0;
        // Iterate through each 'account' in the 'accounts' array.
        for (int[] account : accounts) {
            // Initialize a temporary variable 'temp' to store the sum of wealth for the current customer.
            int temp = 0;
            // Iterate through each element 'j' in the 'account'.
            for (int j = 0; j < accounts[0].length; j++) {
                // Add the wealth at index 'j' to the 'temp' variable.
                temp += account[j];
            }
            // Check if the wealth of the current customer ('temp') is greater than the current maximum wealth ('maxVal').
            // If so, update 'maxVal' to the wealth of the current customer.
            if (temp > maxVal) {
                maxVal = temp;
            }
        }
        // Return the maximum wealth among all the customers.
        return maxVal;
    }
}