-
Notifications
You must be signed in to change notification settings - Fork 27
/
Copy path1672.RichestCustomerWealth.py
46 lines (39 loc) · 1.63 KB
/
1672.RichestCustomerWealth.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
"""
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:
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:
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:
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
"""
#Difficuly: Easy
#34 / 34 test cases passed.
#Runtime: 48 ms
#Memory Usage: 14.4 MB
#Runtime: 48 ms, faster than 100.00% of Python3 online submissions for Richest Customer Wealth.
#Memory Usage: 14.4 MB, less than 66.67% of Python3 online submissions for Richest Customer Wealth.
class Solution:
def maximumWealth(self, accounts: List[List[int]]) -> int:
return max(sum(account) for account in accounts)