26. 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.

Solution: (Brute Force)

Maintaining count of server in each row and columns

class Solution
{
public:
    int countServers(vector<vector<int>> &grid)
    {

        int n = grid.size();
        int m = grid[0].size();

        vector<int> rc(n);
        vector<int> cc(m);

        for (int i = 0; i < grid.size(); i++)
        {
            for (int j = 0; j < grid[0].size(); j++)
            {

                if (grid[i][j] == 1)
                {
                    rc[i]++;
                    cc[j]++;
                }
            }
        }

        int res = 0;
        for (int i = 0; i < grid.size(); i++)
        {
            for (int j = 0; j < grid[0].size(); j++)
            {

                if (grid[i][j] == 1)
                {
                    if (rc[i] >= 2 || cc[j] >= 2)
                    {
                        res++;
                    }
                }
            }
        }

        return res;
    }
};

Time Complexity: O(n * m) Space Complexity: O(n + m)