1672. Richest Customer Wealth Обновлено: 2024-03-12 1 мин Algorithms , LeetCode СодержаниеLeetCode problem 1672class Solution: def maximumWealth(self, accounts: List[List[int]]) -> int: return max(sum(v) for v in accounts)