◎欢迎参与讨论,请在这里发表您的看法、交流您的观点。
https://leetcode.com/problems/richest-customer-wealth/description/
class solution { public int maximumwealth (int[][] accounts) { int wealth = 0; for (int[] customer : accounts) { int currentcustomerwealth = 0; for (int bank : customer) { currentcustomerwealth += bank; } wealth = math.max(wealth , currentcustomerwealth); } return wealth ; } }
class Solution { public int maximumWealth(int[][] accounts) { int wealth = 0; // Loop through each customer for (int i = 0; i < accounts.length; i++) { int currentCustomerWealth = 0; // Loop through each bank account for the current customer for (int j = 0; j < accounts[i].length; j++) { currentCustomerWealth += accounts[i][j]; // Add the bank balance to current customer's wealth } // Update maximum wealth if current is greater wealth = Math.max(wealth, currentCustomerWealth); } return wealth; // Return the maximum wealth found } }
◎欢迎参与讨论,请在这里发表您的看法、交流您的观点。