알고리즘
[LeetCode] 1672. Richest Customer Wealth
유병각
2022. 4. 24. 00:08
[LeetCode] 1672. Richest Customer Wealth
풀이_#1
class Solution(object):
def maximumWealth(self, accounts):
"""
:type accounts: List[List[int]]
:rtype: int
"""
n = [sum(accounts[i]) for i in range(len(accounts))]
n.sort()
return n[-1]풀이_#2
map 을 사용한 짧고 멋진 풀이
class Solution(object):
def maximumWealth(self, accounts):
"""
:type accounts: List[List[int]]
:rtype: int
"""
return max(map(sum, accounts))