iSharkFly-Docs/java-tutorials
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update SetMatrixToZero.java

Browse Source
This commit is contained in:
anujgaud 2024-04-09 23:18:22 +05:30 committed by GitHub
parent dbd9448e99
commit 306d2da98c
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 65 additions and 42 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

49
core-java-modules/core-java-arrays-operations-advanced-2/src/main/java/com/baeldung/matrixtozero/SetMatrixToZero.java
View File

@ -63,27 +63,25 @@ public class SetMatrixToZero{
} }
} }
static void setZeroesByOptimalApproach(int[][] matrix){ static boolean hasZeroInFirstRow(int[][] matrix, int cols) {
int rows = matrix.length;
int cols = matrix[0].length;
boolean firstRowZero = false;
boolean firstColZero = false;
for (int j = 0; j < cols; j++) { for (int j = 0; j < cols; j++) {
if (matrix[0][j] == 0) { if (matrix[0][j] == 0) {
firstRowZero = true; return true;
break;
} }
} }
return false;
}
static boolean hasZeroInFirstCol(int[][] matrix, int rows) {
for (int i = 0; i < rows; i++) { for (int i = 0; i < rows; i++) {
if (matrix[i][0] == 0) { if (matrix[i][0] == 0) {
firstColZero = true; return true;
break;
} }
} }
return false;
}
static void markZeroesInMatrix(int[][] matrix, int rows, int cols) {
for (int i = 1; i < rows; i++) { for (int i = 1; i < rows; i++) {
for (int j = 1; j < cols; j++) { for (int j = 1; j < cols; j++) {
if (matrix[i][j] == 0) { if (matrix[i][j] == 0) {
@ -92,7 +90,9 @@ public class SetMatrixToZero{
} }
} }
} }
}
static void setZeroesInRows(int[][] matrix, int rows, int cols) {
for (int i = 1; i < rows; i++) { for (int i = 1; i < rows; i++) {
if (matrix[i][0] == 0) { if (matrix[i][0] == 0) {
for (int j = 1; j < cols; j++) { for (int j = 1; j < cols; j++) {
@ -100,7 +100,9 @@ public class SetMatrixToZero{
} }
} }
} }
}
static void setZeroesInCols(int[][] matrix, int rows, int cols) {
for (int j = 1; j < cols; j++) { for (int j = 1; j < cols; j++) {
if (matrix[0][j] == 0) { if (matrix[0][j] == 0) {
for (int i = 1; i < rows; i++) { for (int i = 1; i < rows; i++) {
@ -108,17 +110,38 @@ public class SetMatrixToZero{
} }
} }
} }
}
if(firstRowZero){ static void setZeroesInFirstRow(int[][] matrix, int cols) {
for (int j = 0; j < cols; j++) { for (int j = 0; j < cols; j++) {
matrix[0][j] = 0; matrix[0][j] = 0;
} }
} }
if(firstColZero){ static void setZeroesInFirstCol(int[][] matrix, int rows) {
for (int i = 0; i < rows; i++) { for (int i = 0; i < rows; i++) {
matrix[i][0] = 0; matrix[i][0] = 0;
} }
} }
static void setZeroesByOptimalApproach(int[][] matrix) {
int rows = matrix.length;
int cols = matrix[0].length;
boolean firstRowZero = hasZeroInFirstRow(matrix, cols);
boolean firstColZero = hasZeroInFirstCol(matrix, rows);
markZeroesInMatrix(matrix, rows, cols);
setZeroesInRows(matrix, rows, cols);
setZeroesInCols(matrix, rows, cols);
if (firstRowZero) {
setZeroesInFirstRow(matrix, cols);
}
if (firstColZero) {
setZeroesInFirstCol(matrix, rows);
} }
} }
}