KeshavAnandCode/competitive-programming
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

readonly fix

Browse Source
This commit is contained in:
Keshav Anand
2026-04-18 11:33:37 -05:00
parent b578ed198f
commit b89de536f4
1 changed files with 1 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
solutions/practice/Minesweeper.java
View File

@@ -1,8 +1,8 @@
// General imports // General imports
import java.util.*;
import java.io.*; import java.io.*;
import java.math.*; import java.math.*;
import java.util.*;
public class Minesweeper { public class Minesweeper {
static char[][] input; static char[][] input;
@@ -13,7 +13,6 @@ public class Minesweeper {
static int b; static int b;
public static void main(String[] args) { public static void main(String[] args) {
Scanner sc = new Scanner(System.in); Scanner sc = new Scanner(System.in);
// Write code here // Write code here
@@ -50,11 +49,9 @@ public class Minesweeper {
String s = String.format("%.3f", maxProb); String s = String.format("%.3f", maxProb);
System.out.println(s); System.out.println(s);
} }
} }
public static void solve(int index, char[][] grid, int bombs) { public static void solve(int index, char[][] grid, int bombs) {
if (index >= r * c) { if (index >= r * c) {
if (bombs == b && isValid(grid)) { if (bombs == b && isValid(grid)) {
addPoss(grid); addPoss(grid);
@@ -86,7 +83,6 @@ public class Minesweeper {
} }
return; return;
} }
public static boolean isValid(char[][] grid) { public static boolean isValid(char[][] grid) {
@@ -118,9 +114,7 @@ public class Minesweeper {
if (grid[i][j] == '#') { if (grid[i][j] == '#') {
safe[i][j]++; safe[i][j]++;
} }
} }
} }
} }
} }