문제
m x n 정수 그리드 계정이 부여됩니다. 여기서 계정 [i][j]은 고객이 jth 은행에 가지고 있는 돈의 양입니다. 가장 부유한 고객이 가지고 있는 부를 돌려주세요.
고객의 재산은 그들이 모든 은행 계좌에 가지고 있는 돈의 양이다. 가장 부유한 고객은 가장 큰 부를 가진 고객이다.
https://leetcode.com/problems/richest-customer-wealth/
You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the ith customer has in the jth 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
풀이
class Solution {
public int maximumWealth(int[][] accounts) {
int max = 0;
int min = 0;
for(int i = 0; i<accounts.length;i++){
for(int data : accounts[i]){
min+=data;
}
max=(max>min)?max:min;
min=0;
}
return max;
}
}