diagonal difference hackerrank solution in java 8 using list
public static int diagonalDifference(List<List<Integer>> arr) {
// Write your code here
int leftd=0;
int rightd=0;
int n=arr.size();
for(int i=0;i<n;i++)
{
leftd+=arr.get(i).get(i);
rightd+=arr.get(i).get(n-i-1);
}
int absd=Math.abs(leftd-rightd);
return absd;
}prim =0
sec=0
length = len(arr[0])
for count in range(length):
prim += arr[count][count]
sec += arr[count][(length-count-1)]
return abs(prim-sec)
Also in Java:
- java string length validation regex
- raspberry stackexchange how to install the java jdk
- change java version command line debian
- java.sql.SQLException: Before start of result set
- how to make a variable unchangeable in java
- list in java
- check if value exists in hashset java
- java concatenate arrays
- generate all prime number less than n java (fastest method)
- declare class variable in java
- check if a string is a substring of another string java
- logging in java
- java lerp
- how to select a element in an arraylist java
- working with buttons in applet java
- 2 decimal places print format JAVA
- generate all prime number less than n java
- how to install java runtime environment on centos 7
- copy array in java
- java initialize string array
- java find if element of list in present in another list
- 2d array length in java
- The shrinker may have failed to optimize the Java bytecode. To disable the shrinker, pass the `--no-shrink` flag to this command.
- how to remove spaces from an array in java