[LEETCODE] 1672. Richest Customer Wealth

 

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

 

나의 풀이

class Solution:
    def maximumWealth(self, accounts: List[List[int]]) -> int:
        arr = []
        for val in accounts:
            arr.append(sum(val))
        max_index = arr.index(max(arr))
        return max(arr)

갑자기 람다식 reduce 생각나서 account 배열 순회해서 누적하는 뻘짓 할뻔 했으나 sum함수와 max함수란 편리한 기능이 있음을 찾아내고 코드를 수정하였다. 결과는 다행이 통과...

 

다른 사람 풀이

def maximumWealth(self, accounts: List[List[int]]) -> int:
    return max(map(sum, accounts))

ㅋㅋㅋㅋ 한줄로 끝나버림 map이란 개념을 그래도 생각하긴 했는데... 앞으로 더 열심히 ㅠ