Skip to content

Commit d56855e

Browse files
author
khalidx3
committed
Format SudokuSolver.java using clang-format
1 parent 06d0592 commit d56855e

File tree

1 file changed

+56
-66
lines changed

1 file changed

+56
-66
lines changed

src/main/java/com/thealgorithms/backtracking/SudokuSolver.java

Lines changed: 56 additions & 66 deletions
Original file line numberDiff line numberDiff line change
@@ -2,83 +2,73 @@
22

33
public class SudokuSolver {
44

5-
public static boolean sudokuSolver(int[][] sudoku, int row, int col) {
6-
if (row == 9) {
7-
return true; // base case: reached the end
8-
}
5+
public static boolean sudokuSolver(int[][] sudoku, int row, int col) {
6+
if (row == 9) {
7+
return true; // base case: reached the end
8+
}
99

10-
int nextRow = row;
11-
int nextCol = col + 1;
12-
if (nextCol == 9) {
13-
nextRow = row + 1;
14-
nextCol = 0;
15-
}
10+
int nextRow = row;
11+
int nextCol = col + 1;
12+
if (nextCol == 9) {
13+
nextRow = row + 1;
14+
nextCol = 0;
15+
}
1616

17-
if (sudoku[row][col] != 0) {
18-
return sudokuSolver(sudoku, nextRow, nextCol);
19-
}
17+
if (sudoku[row][col] != 0) {
18+
return sudokuSolver(sudoku, nextRow, nextCol);
19+
}
2020

21-
for (int num = 1; num <= 9; num++) {
22-
if (isSafe(sudoku, row, col, num)) {
23-
sudoku[row][col] = num;
24-
if (sudokuSolver(sudoku, nextRow, nextCol)) {
25-
return true;
26-
}
27-
sudoku[row][col] = 0; // backtrack
28-
}
21+
for (int num = 1; num <= 9; num++) {
22+
if (isSafe(sudoku, row, col, num)) {
23+
sudoku[row][col] = num;
24+
if (sudokuSolver(sudoku, nextRow, nextCol)) {
25+
return true;
26+
}
27+
sudoku[row][col] = 0; // backtrack
2928
}
30-
return false;
31-
}
29+
}
30+
return false;
31+
}
3232

33-
private static boolean isSafe(int[][] sudoku, int row, int col, int num) {
34-
// Check row and column
35-
for (int i = 0; i < 9; i++) {
36-
if (sudoku[row][i] == num || sudoku[i][col] == num) {
37-
return false;
38-
}
33+
private static boolean isSafe(int[][] sudoku, int row, int col, int num) {
34+
// Check row and column
35+
for (int i = 0; i < 9; i++) {
36+
if (sudoku[row][i] == num || sudoku[i][col] == num) {
37+
return false;
3938
}
39+
}
4040

41-
// Check 3x3 subgrid
42-
int startRow = row - row % 3;
43-
int startCol = col - col % 3;
44-
for (int i = startRow; i < startRow + 3; i++) {
45-
for (int j = startCol; j < startCol + 3; j++) {
46-
if (sudoku[i][j] == num) {
47-
return false;
48-
}
49-
}
41+
// Check 3x3 subgrid
42+
int startRow = row - row % 3;
43+
int startCol = col - col % 3;
44+
for (int i = startRow; i < startRow + 3; i++) {
45+
for (int j = startCol; j < startCol + 3; j++) {
46+
if (sudoku[i][j] == num) {
47+
return false;
48+
}
5049
}
50+
}
5151

52-
return true;
53-
}
52+
return true;
53+
}
5454

55-
private static void printSudoku(int[][] sudoku) {
56-
for (int i = 0; i < 9; i++) {
57-
for (int j = 0; j < 9; j++) {
58-
System.out.print(sudoku[i][j] + " ");
59-
}
60-
System.out.println();
55+
private static void printSudoku(int[][] sudoku) {
56+
for (int i = 0; i < 9; i++) {
57+
for (int j = 0; j < 9; j++) {
58+
System.out.print(sudoku[i][j] + " ");
6159
}
62-
}
60+
System.out.println();
61+
}
62+
}
6363

64-
public static void main(String[] args) {
65-
int[][] sudoku = {
66-
{ 5, 3, 0, 0, 7, 0, 0, 0, 0 },
67-
{ 6, 0, 0, 1, 9, 5, 0, 0, 0 },
68-
{ 0, 9, 8, 0, 0, 0, 0, 6, 0 },
69-
{ 8, 0, 0, 0, 6, 0, 0, 0, 3 },
70-
{ 4, 0, 0, 8, 0, 3, 0, 0, 1 },
71-
{ 7, 0, 0, 0, 2, 0, 0, 0, 6 },
72-
{ 0, 6, 0, 0, 0, 0, 2, 8, 0 },
73-
{ 0, 0, 0, 4, 1, 9, 0, 0, 5 },
74-
{ 0, 0, 0, 0, 8, 0, 0, 7, 9 }
75-
};
64+
public static void main(String[] args) {
65+
int[][] sudoku = {{5, 3, 0, 0, 7, 0, 0, 0, 0}, {6, 0, 0, 1, 9, 5, 0, 0, 0}, {0, 9, 8, 0, 0, 0, 0, 6, 0}, {8, 0, 0, 0, 6, 0, 0, 0, 3}, {4, 0, 0, 8, 0, 3, 0, 0, 1}, {7, 0, 0, 0, 2, 0, 0, 0, 6}, {0, 6, 0, 0, 0, 0, 2, 8, 0}, {0, 0, 0, 4, 1, 9, 0, 0, 5}, {0, 0, 0, 0, 8, 0, 0, 7, 9}};
7666

77-
if (sudokuSolver(sudoku, 0, 0)) {
78-
System.out.println("Sudoku Solved:");
79-
printSudoku(sudoku);
80-
} else {
81-
System.out.println("No solution exists.");
82-
}
83-
}
67+
if (sudokuSolver(sudoku, 0, 0)) {
68+
System.out.println("Sudoku Solved:");
69+
printSudoku(sudoku);
70+
} else {
71+
System.out.println("No solution exists.");
72+
}
73+
}
8474
}

0 commit comments

Comments
 (0)