CodeEval/MineSweeper.java at master · aliabbasrizvi/CodeEval · GitHub

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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;

public class MineSweeper {
	int[][] grid;
	int m, n;

	private void prepareGrid(String values) {
		int i, j;

		for (i = 0; i < m; i++) {
			for (j = 0; j < n; j++) {
				if (values.charAt(i*n + j) == '*') {
					grid[i][j] = -1;
				}
			}
		}
	}

	private void fillGrid() {
		int i, j;
		for (i = 1; i < m-1; i++) {
			for (j = 1; j < n-1; j++) {
				if (grid[i][j] == -1) {
					if (grid[i-1][j-1] != -1) {
						grid[i-1][j-1]++;
					}
					if (grid[i-1][j] != -1) {
						grid[i-1][j]++;
					}
					if (grid[i-1][j+1] != -1) {
						grid[i-1][j+1]++;
					}
					if (grid[i][j-1] != -1) {
						grid[i][j-1]++;
					}
					if (grid[i][j+1] != -1) {
						grid[i][j+1]++;
					}
					if (grid[i+1][j-1] != -1) {
						grid[i+1][j-1]++;
					}
					if (grid[i+1][j] != -1) {
						grid[i+1][j]++;
					}
					if (grid[i+1][j+1] != -1) {
						grid[i+1][j+1]++;
					}
				}
			}
		}

		// First row
		for (j = 0; j < n; j++) {
			if (grid[0][j] == -1) {
				if (j != 0 && grid[0][j-1] != -1) {
					grid[0][j-1]++;
				}
				if (j != 0 && grid[1][j-1] != -1) {
					grid[1][j-1]++;
				}
				if (grid[1][j] != -1) {
					grid[1][j]++;
				}
				if (j != n-1 && grid[0][j+1] != -1) {
					grid[0][j+1]++;
				}
				if (j != n-1 && grid[1][j+1] != -1) {
					grid[1][j+1]++;
				}
			}
		}

		// Last row
		for (j = 0; j < n; j++) {
			if (grid[m-1][j] == -1) {
				if (j != 0 && grid[m-1][j-1] != -1) {
					grid[m-1][j-1]++;
				}
				if (j != 0 && grid[m-2][j-1] != -1) {
					grid[m-2][j-1]++;
				}
				if (grid[m-2][j] != -1) {
					grid[m-2][j]++;
				}
				if (j != n-1 && grid[m-2][j+1] != -1) {
					grid[m-2][j+1]++;
				}
				if (j != n-1 && grid[m-1][j+1] != -1) {
					grid[m-1][j+1]++;
				}
			}
		}

		// First column
		for (i = 1; i < m-1; i++) {
			if (grid[i][0] == -1) {
				if (grid[i-1][0] != -1) {
					grid[i-1][0]++;
				}
				if (grid[i-1][1] != -1) {
					grid[i-1][1]++;
				}
				if (grid[i][1] != -1) {
					grid[i][1]++;
				}
				if (grid[i+1][1] != -1) {
					grid[i+1][1]++;
				}
				if (grid[i+1][0] != -1) {
					grid[i+1][0]++;
				}
			}
		}

		// Last column
		for (i = 1; i < m-1; i++) {
			if (grid[i][n-1] == -1) {
				if (grid[i-1][n-1] != -1) {
					grid[i-1][n-1]++;
				}
				if (grid[i-1][n-2] != -1) {
					grid[i-1][n-2]++;
				}
				if (grid[i][n-2] != -1) {
					grid[i][n-2]++;
				}
				if (grid[i+1][n-2] != -1) {
					grid[i+1][n-2]++;
				}
				if (grid[i+1][n-1] != -1) {
					grid[i+1][n-1]++;
				}
			}
		}
	}

	private void displayGrid() {
		int i, j;

		for (i = 0; i < m; i++) {
			for (j = 0; j < n; j++) {
				if (grid[i][j] == -1) {
					System.out.print("*");
				} else {
					System.out.print(grid[i][j]);
				}
			}
		}
		System.out.println();
	}

	public MineSweeper(String filename) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader(filename));
		String line;

		while ((line = br.readLine()) != null) {
			String[] params = line.split(";");
			if (params.length != 2) {
				System.out.println("Insufficient parameters. Skipping line.");
				continue;
			}

			String[] dimensions = params[0].split(",");
			if (dimensions.length != 2) {
				System.out.println("Insufficient parameters. Skipping line.");
			}

			m = Integer.valueOf(dimensions[0]).intValue();
			n = Integer.valueOf(dimensions[1]).intValue();

			grid = new int[m][n];

			prepareGrid(params[1]);
			fillGrid();
			displayGrid();
		}
	}

	public static void main (String[] args) throws IOException {
		if (args.length != 1) {
			System.out.println("Unsupported number of parameters passed. Exiting.");
			System.exit(1);
		}

		MineSweeper ms = new MineSweeper(args[0]);
	}
}