mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-26 07:18:56 +08:00
44 lines
1.6 KiB
HTML
44 lines
1.6 KiB
HTML
<p>You are given an <code>m x n</code> integer grid <code>accounts</code> where <code>accounts[i][j]</code> is the amount of money the <code>i<sup>th</sup></code> customer has in the <code>j<sup>th</sup></code> bank. Return<em> the <strong>wealth</strong> that the richest customer has.</em></p>
|
||
|
||
<p>A customer's <strong>wealth</strong> is the amount of money they have in all their bank accounts. The richest customer is the customer that has the maximum <strong>wealth</strong>.</p>
|
||
|
||
<p> </p>
|
||
<p><strong>Example 1:</strong></p>
|
||
|
||
<pre>
|
||
<strong>Input:</strong> accounts = [[1,2,3],[3,2,1]]
|
||
<strong>Output:</strong> 6
|
||
<strong>Explanation</strong><strong>:</strong>
|
||
<code>1st customer has wealth = 1 + 2 + 3 = 6
|
||
</code><code>2nd customer has wealth = 3 + 2 + 1 = 6
|
||
</code>Both customers are considered the richest with a wealth of 6 each, so return 6.
|
||
</pre>
|
||
|
||
<p><strong>Example 2:</strong></p>
|
||
|
||
<pre>
|
||
<strong>Input:</strong> accounts = [[1,5],[7,3],[3,5]]
|
||
<strong>Output:</strong> 10
|
||
<strong>Explanation</strong>:
|
||
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.</pre>
|
||
|
||
<p><strong>Example 3:</strong></p>
|
||
|
||
<pre>
|
||
<strong>Input:</strong> accounts = [[2,8,7],[7,1,3],[1,9,5]]
|
||
<strong>Output:</strong> 17
|
||
</pre>
|
||
|
||
<p> </p>
|
||
<p><strong>Constraints:</strong></p>
|
||
|
||
<ul>
|
||
<li><code>m == accounts.length</code></li>
|
||
<li><code>n == accounts[i].length</code></li>
|
||
<li><code>1 <= m, n <= 50</code></li>
|
||
<li><code>1 <= accounts[i][j] <= 100</code></li>
|
||
</ul>
|