leetcode-solutions/1267.py at main · juneguo257/leetcode-solutions · 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
class Solution:
    def countServers(self, grid: List[List[int]]) -> int:
        serverRows = {}
        serverCols = {}

        m = len(grid)
        n = len(grid[0])

        # add servers to existence map
        for i in range(m):
            for j in range(n):
                if (grid[i][j] == 1):
                    if (i in serverRows):
                        serverRows[i] += 1
                    else:
                        serverRows[i] = 1

                    if (j in serverCols):
                        serverCols[j] += 1
                    else:
                        serverCols[j] = 1

        overlapServers = 0
        for i in range(m):
            for j in range(n):
                if (grid[i][j] == 1):
                    if (serverRows[i] >= 2 or serverCols[j] >= 2):
                        overlapServers += 1

        return overlapServers