1672. Richest Customer Wealth -with java- (leetcode.com).

Solution.java

/*
Your runtime beats 100.00 % of java submissions.
Your memory usage beats 47.74 % of java submissions.
*/
class Solution {
    public int maximumWealth(int[][] accounts) {
        int max = 0;
        int sum = 0;
        for (int i = 0 ; i < accounts.length ; i++){
            for (int j = 0 ; j < accounts[0].length ; j++){
                sum += accounts[i][j];
            }
            if (sum > max)max = sum;
            sum = 0;
        }
        return max;
    }
}