-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDiagonalSum.java
More file actions
57 lines (54 loc) · 1.78 KB
/
Copy pathDiagonalSum.java
File metadata and controls
57 lines (54 loc) · 1.78 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
import java.util.Scanner;
public class DiagonalSum {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter the number of rows : ");
int rows = sc.nextInt();
System.out.print("Enter the number of columns : ");
int columns = sc.nextInt();
if(rows!=columns){
System.out.println("This sum only applies on square matrices ");
return;
}
int array [][] = new int[rows][columns];
System.out.println("Enter the elements of the array ");
for(int i =0; i<rows; i++){
for(int j =0; j<columns; j++){
array[i][j] = sc.nextInt();
}
}
System.out.println("Enter \n1.Diagonal Sum \n2.Anti-Diagonal Sum");
int choice = sc.nextInt();
if(choice==1){
System.out.println("The sum of Diagonal is " + diagonalSum(array, rows, columns));
}
else if (choice==2){
System.out.println("The sum of Anti-Diagonal is " + antiDiagonalSum(array, rows, columns));
}
else{
System.out.println("The choiice is invalid ");
}
}
public static int diagonalSum(int arr[][], int rows, int columns){
int sum = 0;
for(int i =0; i<rows; i++){
for(int j =0; j<columns; j++){
if(i==j){
sum += arr[i][j];
}
}
}
return sum;
}
public static int antiDiagonalSum(int arr[][] , int rows , int columns){
int sum = 0;
for(int i =0; i<rows; i++){
for(int j =0; j<columns; j++){
if(i+j ==columns-1){
sum += arr[i][j];
}
}
}
return sum;
}
}