Notice
Recent Posts
Recent Comments
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
Tags
- 편스토랑 우승상품
- SW Expert Academy
- AI 경진대회
- 맥북
- 캐치카페
- 프로그래머스 파이썬
- gs25
- ubuntu
- programmers
- 편스토랑
- hackerrank
- Baekjoon
- Docker
- 프로그래머스
- Git
- dacon
- 더현대서울 맛집
- 금융문자분석경진대회
- 파이썬
- ChatGPT
- PYTHON
- github
- Kaggle
- leetcode
- 백준
- 코로나19
- 자연어처리
- Real or Not? NLP with Disaster Tweets
- 데이콘
- 우분투
Archives
- Today
- Total
솜씨좋은장씨
[leetCode] 1672. Richest Customer Wealth (Python) 본문
728x90
반응형

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 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
Constraints:
- m == accounts.length
- n == accounts[i].length
- 1 <= m, n <= 50
- 1 <= accounts[i][j] <= 100
Solution
class Solution:
def maximumWealth(self, accounts: List[List[int]]) -> int:
accounts = [sum(acc) for acc in accounts]
return max(accounts)



SOMJANG/CODINGTEST_PRACTICE
1일 1문제 since 2020.02.07. Contribute to SOMJANG/CODINGTEST_PRACTICE development by creating an account on GitHub.
github.com
'Programming > 코딩 1일 1문제' 카테고리의 다른 글
[leetCode] 1464. Maximum Product of Two Elements in an Array (Python) (0) | 2020.12.17 |
---|---|
[leetCode] 1662. Check If Two String Arrays are Equivalent (Python) (0) | 2020.12.12 |
[leetCode] 1678. Goal Parser Interpretation (Python) (0) | 2020.12.08 |
[leetCode] 1588. Sum of All Odd Length Subarrays (Python) (0) | 2020.12.07 |
[leetCode] 1436. Destination City (Python) (0) | 2020.12.06 |