【LeetCode第 164 场周赛】 5272. Count Servers that Communicate

版权声明：本文为博主原创文章，遵循 CC 4.0 BY 版权协议，转载请附上原文出处链接和本声明。

本文链接：https://blog.csdn.net/shiliang97/article/details/103223759

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

来源：力扣（LeetCode） 链接：https://leetcode-cn.com/problems/count-servers-that-communicate 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

class Solution {
public:
    int countServers(vector<vector<int>>& grid) {
        int m=grid.size();
        int n=grid[0].size();
        vector<int> mm(m);
        vector<int> nn(n);
        for(int i=0;i<m;i++){
            for(int l=0;l<n;l++){
                if(grid[i][l]==1){
                    mm[i]++;
                    nn[l]++;
                }
            }
        }int sum=0;
        for(int i=0;i<m;i++)
        {
            for(int l=0;l<n;l++){
                if(grid[i][l]==1){
                    if(mm[i]>1||nn[l]>1){
                        sum++;
                    }
                }
            }
        }return sum;
    }
};