From 4565a3e648051e226aa85ee43e5453834ab2ed8c Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Wed, 25 Jan 2023 23:50:41 -0500 Subject: [PATCH] Create README - LeetHub --- 1672-richest-customer-wealth/README.md | 41 ++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 1672-richest-customer-wealth/README.md diff --git a/1672-richest-customer-wealth/README.md b/1672-richest-customer-wealth/README.md new file mode 100644 index 0000000..19858e7 --- /dev/null +++ b/1672-richest-customer-wealth/README.md @@ -0,0 +1,41 @@ +
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.lengthn == accounts[i].length1 <= m, n <= 501 <= accounts[i][j] <= 100