We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
public static int diagonalDifference(List> arr) {
int d1Sum = 0;
int d2Sum = 0;
for (int i =0; i < arr.size(); i++) {
d1Sum = d1Sum + arr.get(i).get(i);
d2Sum = d2Sum + arr.get(i).get(arr.size()-1 -i);
}
return Math.abs(d1Sum-d2Sum);
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Diagonal Difference
You are viewing a single comment's thread. Return to all comments →
public static int diagonalDifference(List> arr) { int d1Sum = 0; int d2Sum = 0; for (int i =0; i < arr.size(); i++) { d1Sum = d1Sum + arr.get(i).get(i); d2Sum = d2Sum + arr.get(i).get(arr.size()-1 -i); }