-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdiagonalDiff.java
More file actions
106 lines (80 loc) · 2.55 KB
/
diagonalDiff.java
File metadata and controls
106 lines (80 loc) · 2.55 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
import java.util.*;
public class diagonalDiff {
public static int diagonalDifference(List<List<Integer>> arr) {
// Write your code here
// left and right sums; cols = rows = length.arr
// rightSum: 4x4; n = 4; (0,3) (1, 2) (3, 1) (4, 0)
// 3x3, n = 3: right = (0,2) (1,1), (2,0);
// int diff = 0;
int leftSum = 0;
int rightSum = 0;
int n = arr.size();
for (int i = 0; i < n; i++) {
System.out.println("15i: " + i);
for (int j = 0; j < n; j++) {
System.out.println("17j: " + j);
if (i == j) {
System.out.println("18arr.get(i).get(j): " + arr.get(i).get(j));
leftSum += arr.get(i).get(j);
System.out.println("20leftSum: " + leftSum);
}
if (j == n - 1 - i) {
System.out.println("21ij: " + j + ", n-1-i: " + (n - 1 - i));
System.out.println("22arr.get(i).get(j): " + arr.get(i).get(j));
rightSum += arr.get(i).get(j);
System.out.println("26rightSum: " + rightSum);
}
}
}
return Math.abs(leftSum - rightSum);
}
public static void main(String[] args) {
List<List<Integer>> arr = List.of(
List.of(11, 2, 4),
List.of(4, 5, 6),
List.of(10, 8, -12)
);
System.out.println("Output: " + diagonalDifference(arr));
}
}
/*
* https://www.hackerrank.com/challenges/diagonal-difference/problem
* Given a square matrix, calculate the absolute difference between the sums of its diagonals.
For example, the square matrix is shown below:
1 2 3
4 5 6
9 8 9
The left-to-right diagonal = . The right to left diagonal = . Their absolute difference is .
Function description
Complete the function in the editor below.
diagonalDifference takes the following parameter:
int arr[n][m]: an array of integers
Return
int: the absolute diagonal difference
Input Format
The first line contains a single integer, , the number of rows and columns in the square matrix .
Each of the next lines describes a row, , and consists of space-separated integers .
Constraints
Output Format
Return the absolute difference between the sums of the matrix's two diagonals as a single integer.
Sample Input
3
11 2 4
4 5 6
10 8 -12
Sample Output
15
Explanation
The primary diagonal is:
11
5
-12
Sum across the primary diagonal: 11 + 5 - 12 = 4
The secondary diagonal is:
4
5
10
Sum across the secondary diagonal: 4 + 5 + 10 = 19
Difference: |4 - 19| = 15
Note: |x| is the absolute value of x
*/