Richest Customer Wealth (LeetCode)

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​​​​ the 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

Hints:

Calculate the wealth of each customer

Find the maximum element in array

Richest Customer Wealth (Java)

class Solution {
    public int maximumWealth(int[][] accounts) {
        int ans=0;
	    for(int row=0; row<accounts.length; row++)
	    {
	        int total=0;
	        for(int col=0; col<accounts[row].length; col++)
	        {
	            total=total+accounts[row][col];
	        }
	        if(total>ans)
	        {
	            ans=total;
	        }
	    }
	    return ans;
    }
}

Important Note: for traversing the 2D matrix.
i=row, j=col
for(int i=0; i<nums.length; i++) {
for(int j=0; j<nums[i].length) {
System.out.println(nums[i][j]);
}
}