From b17a5825eadb3471c0d4c686a58d6e31627c541b Mon Sep 17 00:00:00 2001 From: Sushant Gangwar Date: Sun, 2 Oct 2022 19:06:06 +0530 Subject: [PATCH 1/2] Added SaddlePoint Problem Code --- Java/SaddlePoint.java | 60 +++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 60 insertions(+) create mode 100644 Java/SaddlePoint.java diff --git a/Java/SaddlePoint.java b/Java/SaddlePoint.java new file mode 100644 index 0000000..8975c45 --- /dev/null +++ b/Java/SaddlePoint.java @@ -0,0 +1,60 @@ +/* Given a matrix of n x n size, the task is to find the saddle point of the matrix. A saddle point is an element of the matrix such that it is the minimum element in its row and the maximum in its column. + +Examples : + +Input: Mat[3][3] = { {1, 2, 3}, + {4, 5, 6}, + {7, 8, 9}} +Output: 7 +7 is minimum in its row and maximum in its column. + +Input: Mat[3][3] = {{1, 2, 3}, + {4, 5, 6}, + {10, 18, 4}} +Output: No saddle point */ + +import java.util.*; +class SaddlePoint { + public static void main(String args[]) { + Scanner sc = new Scanner(System.in); + int n, j, i, k, max, f = 0, min, c; + System.out.println("Enter matrix size"); + n = sc.nextInt(); + int a[][] = new int[n][n]; + for (i = 0; i < n; i++) { + for (j = 0; j < n; j++) { + System.out.println("Enter the value"); + a[i][j] = sc.nextInt(); + } + } + for (i = 0; i < n; i++) { + for (j = 0; j < n; j++) { + System.out.print(a[i][j] + "\t"); + } + System.out.println(); + } + for (i = 0; i < n; i++) { + min = a[i][0]; + c = 0; + for (j = 0; j < n; j++) { + if (a[i][j] < min) { + min = a[i][j]; + c = j; + } + } + max = a[0][c]; + for (k = 0; k < n; k++) { + if (a[k][c] > max) { + max = a[k][c]; + } + } + if (max == min) { + System.out.println("Saddle Point No. " + max); + f = 1; + } + } + if (f == 0) { + System.out.println("No Saddle Point No. in the Matrix"); + } + } +} From a097c4272ad911cc013e01a5feb2dca9d7e6d0ea Mon Sep 17 00:00:00 2001 From: Sushant Gangwar Date: Sun, 2 Oct 2022 19:14:40 +0530 Subject: [PATCH 2/2] Update SaddlePoint.java --- Java/SaddlePoint.java | 22 ++++++++++++---------- 1 file changed, 12 insertions(+), 10 deletions(-) diff --git a/Java/SaddlePoint.java b/Java/SaddlePoint.java index 8975c45..db1fcaf 100644 --- a/Java/SaddlePoint.java +++ b/Java/SaddlePoint.java @@ -2,15 +2,17 @@ Examples : -Input: Mat[3][3] = { {1, 2, 3}, - {4, 5, 6}, - {7, 8, 9}} +Input: - Enter the matrix size: + - 3 + - Enter the value: + - 1 2 3 4 5 6 7 8 9 Output: 7 7 is minimum in its row and maximum in its column. -Input: Mat[3][3] = {{1, 2, 3}, - {4, 5, 6}, - {10, 18, 4}} +Input: - Enter the matrix size: + - 3 + - Enter the value: + - 1 2 3 4 5 6 10 18 4 Output: No saddle point */ import java.util.*; @@ -18,12 +20,12 @@ class SaddlePoint { public static void main(String args[]) { Scanner sc = new Scanner(System.in); int n, j, i, k, max, f = 0, min, c; - System.out.println("Enter matrix size"); + System.out.println("Enter matrix size:"); n = sc.nextInt(); int a[][] = new int[n][n]; for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { - System.out.println("Enter the value"); + System.out.println("Enter the value:"); a[i][j] = sc.nextInt(); } } @@ -49,12 +51,12 @@ public static void main(String args[]) { } } if (max == min) { - System.out.println("Saddle Point No. " + max); + System.out.println("Saddle Point - " + max); f = 1; } } if (f == 0) { - System.out.println("No Saddle Point No. in the Matrix"); + System.out.println("No Saddle Point in the Matrix"); } } }