1672. Richest Customer Wealth java

https://leetcode.com/problems/richest-customer-wealth/?envType=study-plan&id=programming-skills-i 

Richest Customer Wealth - LeetCode

class Solution {
    public int maximumWealth(int[][] accounts) {
        int max = -1;
        for(int i = 0; i < accounts.length; i++){
            int sum = 0;
            for(int num:accounts[i]){
                sum += num;
            }
            max = Math.max(max, sum);
        }
        return max;
    }
}