来源:力扣(LeetCode) 链接:https://leetcode-cn.com/problems/richest-customer-wealth 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
(accounts: Vec<Vec<i32>>)
| 15 | // 链接:https://leetcode-cn.com/problems/richest-customer-wealth |
| 16 | // 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。 |
| 17 | pub fn maximum_wealth(accounts: Vec<Vec<i32>>) -> i32 { |
| 18 | let mut res = 0; |
| 19 | for account in accounts { |
| 20 | let mut current = 0; |
| 21 | for e in account { |
| 22 | current += e; |
| 23 | } |
| 24 | if current >= res { |
| 25 | res = current |
| 26 | } |
| 27 | } |
| 28 | res |
| 29 | } |