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
Constraints:
- m == accounts.length
- n == accounts[i].length
- 1 <= m, n <= 50
- 1 <= accounts[i][j] <= 100
나의 풀이
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
|
/**
* @param {number[][]} accounts
* @return {number}
*/
var maximumWealth = function(accounts) {
const answer =[]
let sum =0
for(let i=0; i<accounts.length; i++){
for(let j=0; j<accounts[i].length; j++){
sum += accounts[i][j]
}
answer.push(sum)
sum = 0
}
return Math.max(...answer)
};
|
cs |
'코딩 테스트 풀이 🛠' 카테고리의 다른 글
[Leet Code - eazy] 2114. Maximum Number of Words Found in Sentences (0) | 2023.01.29 |
---|---|
[Leet Code - eazy] 2413. Smallest Even Multiple (0) | 2023.01.29 |
[Leet Code - eazy] 771. Jewels and Stones (0) | 2023.01.28 |
[Leet Code - eazy] 1512. Number of Good Pairs (1) | 2023.01.28 |
[Leet Code - eazy] 1470. Shuffle the Array (0) | 2023.01.28 |