-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeftDiagonalSumAndRightDiagonalSum.java
More file actions
72 lines (62 loc) · 2.25 KB
/
Copy pathLeftDiagonalSumAndRightDiagonalSum.java
File metadata and controls
72 lines (62 loc) · 2.25 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
import java.util.Scanner;
/*
* Author : Hasnain Memon
* Date : 02/11/2024
* Question : Q2. Write functions for square matrix to calculate
1. Left diagonal sum
2. Right diagonal sum
*/
public class LeftDiagonalSumAndRightDiagonalSum {
private static int findLeftDiagonalSum(int[][] matrix) {
int sum = 0;
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix.length; j++) {
if (i == j) {
sum += matrix[i][j];
}
}
}
return sum;
}
private static int findRightDiagonalSum(int[][] matrix) {
int sum = 0;
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix.length; j++) {
if ((i + j) == (matrix.length - 1)) {
sum += matrix[i][j];
}
}
}
return sum;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int rows, columns;
int[][] matrix;
System.out.print("Enter number of rows of a matrix: ");
rows = sc.nextInt();
System.out.print("Enter number of columns of a matrix: ");
columns = sc.nextInt();
matrix = new int[rows][columns];
for (int i = 0 ; i < rows; i++) {
for (int j = 0; j < columns; j++) {
System.out.print("Enter element[" + i + "][" + j + "]: ");
matrix[i][j] = sc.nextInt();
}
System.out.println();
}
System.out.println("2D matrix of " + rows + " rows and " + columns + " columns");
for (int i = 0 ; i < rows; i++) {
for (int j = 0; j < columns; j++) {
System.out.print(matrix[i][j] + " ");
}
System.out.println();
}
if (rows != columns) {
System.out.println("\nNon-Square matrix doesn't have left and right diagonals.");
} else {
System.out.println("\nLeft diagonal sum = " + findLeftDiagonalSum(matrix));
System.out.println("Right diagonal sum = " + findRightDiagonalSum(matrix));
}
}
}