leetcode 1672. Richest Customer Wealth（python）

描述

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

Note:

m == accounts.length
n == accounts[i].length
1 <= m, n <= 50
1 <= accounts[i][j] <= 100

解析

根据题意，表 accounts 中的每行数字的和就是该用户的存款总额，只需要便利每行的数字总和，找出最大的数字即可。

解答

class Solution(object):
    def maximumWealth(self, accounts):
        """
        :type accounts: List[List[int]]
        :rtype: int
        """
        mx = -1
        for account in accounts:
            mx = max(mx, sum(account))
        return mx
        	      
# 简化形式
class Solution(object):
	    def maximumWealth(self, accounts):
	        """
	        :type accounts: List[List[int]]
	        :rtype: int
	        """
	        return max(map(sum, accounts))			

运行结果

Runtime: 32 ms, faster than 95.52% of Python online submissions for Richest Customer Wealth.
Memory Usage: 13.6 MB, less than 8.15% of Python online submissions for Richest Customer Wealth.

原题链接：https://leetcode.com/problems/richest-customer-wealth/