1396 Count Servers That Communicate
1396 Count Servers That Communicate
Count Servers that Communicate 
You are given a map of a server center, represented as a m * n integer matrix grid, where 1 means that on that cell there is a server and 0 means that it is no server. Two servers are said to communicate if they are on the same row or on the same column.
Return the number of servers that communicate with any other server.
Example 1:
1
2
3
4
**Input:** grid = [[1,0],[0,1]]
**Output:** 0
**Explanation:** No servers can communicate with others.
Example 2:
1
2
3
4
5
**Input:** grid = [[1,0],[1,1]]
**Output:** 3
**Explanation:** All three servers can communicate with at least one other server.
Example 3:
1
2
3
4
5
**Input:** grid = [[1,1,0,0],[0,0,1,0],[0,0,1,0],[0,0,0,1]]
**Output:** 4
**Explanation:** The two servers in the first row can communicate with each other. The two servers in the third column can communicate with each other. The server at right bottom corner can't communicate with any other server.
Constraints:
1
2
3
4
5
m == grid.length
n == grid[i].length
1 <= m <= 250
1 <= n <= 250
grid[i][j] == 0 or 1
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
func dfs_row(row int, col int, grid [][]int, found bool) (int ) {
res := 0
for k , v := range grid[row] {
if v == 1 {
grid[row][k] = 0
res += res + 1+ dfs_row(row, k , grid, true)
}
}
for a := range len(grid) {
if grid[a][col] == 1 {
grid[a][col] = 0
res = res + 1 + dfs_row(a, col , grid, true)
//grid[a][col] = 1
}
}
if !found && res == 1 {
return 0
}
return res
}
func countServers(grid [][]int) int {
res := make(map[string]bool, 0)
first_match_row := make(map[int][]string)
first_match_col := make(map[int][]string)
//mp := make(map[int]int, 0)
for i , _ := range grid {
for j , _ := range grid[0] {
if grid[i][j] == 1 {
_, ok1 := first_match_row[i]
_, ok2 := first_match_col[j]
if !ok1 {
first_match_row[i] = make([]string, 0)
}
if !ok2 {
first_match_col[j] = make([]string, 0)
}
first_match_row[i] = append(first_match_row[i], strconv.Itoa(i)+"$"+ strconv.Itoa(j))
first_match_col[j] = append(first_match_col[j], strconv.Itoa(i)+"$"+ strconv.Itoa(j))
//fmt.Println(i,j,res,first_match_row, first_match_col, row, col, ok1, ok2)
}
}
}
for _,v := range first_match_row {
if len(v) == 1 {
continue
}
for _, v1 := range v {
res[v1] = true
}
}
for _,v := range first_match_col {
if len(v) == 1 {
continue
}
for _, v1 := range v {
res[v1] = true
}
}
return len(res)
}
This post is licensed under CC BY 4.0 by the author.