[LeetCode]#Java 1672. Richest Customer Wealth | by Boom

✊ 程式語言 Program Langue : Java | 難度：簡單(Easy)

✊ 題目敘述：

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.

😜翻譯：將給一個mxn的int二維陣列，請return每一列加總後的最大值(上面的描述是說要return最富有的客戶的金額)。

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

✊範例說明：

以範例二來說明

輸入: accounts = [[1,5],[7,3],[3,5]]
輸出: 10
解釋: 
第一個客戶的錢 = 6
第二個客戶的錢 = 10 
第三個客戶的錢 = 8
第二個客戶的錢最多，所以return 10

Constraints(條件):

• m == accounts.length
• n == accounts[i].length
• 1 <= m, n <= 50
• 1 <= accounts[i][j] <= 100

✊題目分析：

1. 將每一列個別加總
2. 找出最大值

個別加總：

accounts=[[1,5],[7,3],[3,5]]
sum[1,5]
sum[7,3]
sum[3,5]

主要用到的技術：

for,arrays

✊code

👊Submissions(提交)

謝謝你的閱讀:)
如果你喜歡我的分享
歡迎底下留言或來信至boomengineerli@gmail.com 與我分享
期待與更多優秀的夥伴交流😄------------------------------------------------
如果願意給我一些小小鼓勵，請給我1-10個拍手
如果覺得文章對你有點幫助，請給我11-20個拍手
如果想看更多程式的相關文章，請長按拍手按鈕(50個拍爆)讓我知道唷👏最後，如希望持續追蹤我的最新文章，請不要忘記追蹤 Boom ⭐️ 程式自學之旅 謝謝~🙌