1672|Richest Customer Wealth

1672. 最富有客户的资产总量

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

Constraints:
m == accounts.length
n == accounts[i].length
1 <= m, n <= 50
1 <= accounts[i][j] <= 100

我的解题

class Solution {
    public int maximumWealth(int[][] accounts) {
       int max=-1;
     int result[]=new int[accounts.length];
    for(int i=0;i<accounts.length;i++){
        for(int j=0;j<accounts[i].length;j++){
            result[i]+=accounts[i][j];
        }
        if(result[i]>max){
            max=result[i];
        }
    }
    return max;
    }
}

我的解题思路

二维数组，每一行代表一个客户的所有资产，通过遍历数组，把每层的资产 result[i]+=accounts[i][j];赋值给那一层对应的客户result[i]
,然后每一层加完之后比较下是不是最大值,如果>max的话就
max=result[i]