LeetCode --- 1672. Richest Customer Wealth 解题报告

Posted 杨鑫newlfe

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1672. Richest Customer Wealth 解题报告相关的知识,希望对你有一定的参考价值。

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]]
O

以上是关于LeetCode --- 1672. Richest Customer Wealth 解题报告的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode 1672. 最富有客户的资产总量

LeetCode 806. 写字符串需要的行数 / 380. O 时间插入删除和获取随机元素 / 1672. 最富有客户的资产总量

算法零基础学习关于二维数组的一些基础练习题 | leetcode1672158283248题解

算法零基础学习关于二维数组的一些基础练习题 | leetcode1672158283248题解

算法零基础学习关于二维数组的一些基础练习题 | leetcode1672158283248题解

51nod 1672 区间交(贪心)