1672. 最富有客户的资产总量
标签:数组、矩阵
方法:数组循环遍历
难度:简单
思路:
- 按行遍历
- 按列遍历并累加
- 获得的行最终总数与最大值
ans
比较,若大于则赋值,否则重复步骤1
参考代码:
class Solution {
public int maximumWealth(int[][] accounts) {
int ans = 0;
for (int i = 0; i < accounts.length; i++) {
int account = 0;
for (int j = 0; j < accounts[i].length; j++) {
account += accounts[i][j];
}
if (account>ans) ans = account;
}
return ans;
}
}
测试代码:
public class Solution1672 {
public int maximumWealth(int[][] accounts) {
int ans = 0;
for (int i = 0; i < accounts.length; i++) {
int account = 0;
for (int j = 0; j < accounts[i].length; j++) {
account += accounts[i][j];
}
if (account>ans) ans = account;
}
return ans;
}
public static void main(String[] args) {
Solution1672 solution1672 = new Solution1672();
//int [][] accounts = {{1,2,3},{3,2,1}};
int [][] accounts = {{1,5},{7,3},{3,5}};
System.out.println(solution1672.maximumWealth(accounts));
}
}