Introduction
So here the problem is, a 2D array is given. We have to calculate the sum of each row and return the sum of that row which is the maximum in all row.
Examples
Steps
- Take 2 variable max=0, sum=0
- Run a for loop.
- In each row calculate the sum of all element.
- If the sum > max, then max = sum.
- Set the sum = 0;
Java Code
class Solution {
public int maximumWealth(int[][] accounts) {
int max = 0;
int sum = 0;
for(int i = 0; i< accounts.length; i++){
for(int j = 0; j < accounts[i].length; j++){
sum += accounts[i][j];
}
if(max < sum){
max = sum;
}
sum = 0;
}
return max;
}
}
Output
Top comments (0)