LeetCode1267. Count Servers that Communicate(统计参与通信的服务器)

1267. 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:

Input: grid = [[1,0],[0,1]]
Output: 0
Explanation: No servers can communicate with others.

Example 2:

Input: grid = [[1,0],[1,1]]
Output: 3
Explanation: All three servers can communicate with at least one other server.

Example 3:

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:

• m == grid.length
• n == grid[i].length
• 1 <= m <= 250
• 1 <= n <= 250
• grid[i][j] == 0 or 1

---

题目： 这里有一幅服务器分布图，服务器的位置标识在 m * n 的整数矩阵网格 grid 中，1 表示单元格上有服务器，0 表示没有。 如果两台服务器位于同一行或者同一列，我们就认为它们之间可以进行通信。请你统计并返回能够与至少一台其他服务器进行通信的服务器的数量。

思路：参考解析。对于某个服务器，如果其与另一个服务器相连，那么其所在的行和或列和必定大于1。用rows[i]和cols[i]统计每行和每列对应的服务器数目，然后循环grid[i][j]得到结果。

工程代码下载

class Solution {
public:
    int countServers(vector<vector<int>>& grid) {
        int r = grid.size();
		if (r == 0) return 0;
		int c = grid[0].size();
		
		vector<int> rows(r, 0);
		vector<int> cols(c, 0);

		for (int i = 0; i < r; ++i) {
			for (int j = 0; j < c; ++j) {
				if (grid[i][j] == 1) {
					rows[i]++;
					cols[j]++;
				}
			}
		}

		int res = 0;
		for (int i = 0; i < r; ++i) {
			for (int j = 0; j < c; ++j) {
				if (grid[i][j] && (rows[i] > 1 || cols[j] > 1))
					res++;
			}
		}

		return res;
    }
};