Richest Customer Wealth problem LeetCode

 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.

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

code :-

public class codefile{

    static int solve(List<List<Integer>>  input){

       

        ArrayList<Integer> result=new ArrayList<>();

        int row=input.size();

        int col=input.get(0).size();

int maxi=Integer.MIN_VALUE;

        for(int i=0;i<row;i++)

        {

int sum=0;

            for(int j=0;j<col;j++)

            {

                sum=sum+input.get(i).get(j);

                result.add(sum);

            }

        }

        Collections.sort(result);

        return result.get(result.size()-1);

    }

}

leetCode Solution :-

class Solution {

    public int maximumWealth(int[][] accounts) {

       

        ArrayList<Integer> result= new ArrayList<>();

        int row=accounts.length;

        int col=accounts[0].length;

        int maxi=Integer.MIN_VALUE;

        for(int i=0;i<row;i++)

        {

            int sum=0;

            for(int j=0;j<col;j++)

            {

                sum=sum+accounts[i][j];

                result.add(sum);

            }

        }

        Collections.sort(result);

        return result.get(result.size()-1);

    }

}