1
2
3
4
5
6
7
|
class Solution:
def maximumWealth(self, accounts: List[List[int]]) -> int:
tmp=[]
for i in range(len(accounts)):
tmp.append( sum(accounts[i]))
return max(tmp)
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
Leetcode 7. Reverse Integer (0) | 2021.07.12 |
---|---|
Leetcode 1. Two Sum (0) | 2021.07.12 |
Leetcode 1108. Defanging an IP Address (0) | 2021.07.12 |
Leetcode 1480. Running Sum of 1d Array (0) | 2021.07.12 |
Leetcode 1920 (0) | 2021.07.12 |
댓글