-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.cs
More file actions
62 lines (54 loc) · 1.49 KB
/
Solution.cs
File metadata and controls
62 lines (54 loc) · 1.49 KB
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
public class Solution
{
public int CountUnguarded(int m, int n, int[][] guards, int[][] walls)
{
int[,] grid = new int[m, n];
// 0: not guarded cell, 1: guarded cell, -1: wall, 2: guard
foreach (var guard in guards)
{
grid[guard[0], guard[1]] = 2;
}
foreach (var wall in walls)
{
grid[wall[0], wall[1]] = -1;
}
foreach (var guard in guards)
{
int r = guard[0];
int c = guard[1];
for (int i = r - 1; i >= 0; i--)
{
if (grid[i, c] == -1 || grid[i, c] == 2) break;
grid[i, c] = 1;
}
for (int i = r + 1; i < m; i++)
{
if (grid[i, c] == -1 || grid[i, c] == 2) break;
grid[i, c] = 1;
}
for (int i = c - 1; i >= 0; i--)
{
if (grid[r, i] == -1 || grid[r, i] == 2) break;
grid[r, i] = 1;
}
for (int i = c + 1; i < n; i++)
{
if (grid[r, i] == -1 || grid[r, i] == 2) break;
grid[r, i] = 1;
}
}
int count = 0;
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
{
if (grid[i, j] == 0)
{
count++;
}
}
}
ArrayHelper.Print2DArray(grid);
return count;
}
}