zoukankan      html  css  js  c++  java
  • leetcode 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
     1 class Solution {
     2 public:
     3     int countServers(vector<vector<int>>& grid) {
     4         vector<int> row(grid.size(), 0), col(grid[0].size(), 0);
     5         for (int i = 0; i < grid.size(); ++i) {
     6             for (int j = 0; j < grid[0].size(); ++j) {
     7                 if (grid[i][j] == 1) {
     8                     row[i]++;
     9                     col[j]++;
    10                 }
    11             }
    12         }
    13         int cnt = 0;
    14         for (int i = 0; i < grid.size(); ++i) {
    15             for (int j = 0; j < grid[0].size(); ++j) {
    16                 if ((grid[i][j] == 1) && (row[i] > 1 || col[j] > 1))
    17                     cnt++;
    18             }
    19         }
    20         return cnt;
    21     }
    22 };
  • 相关阅读:
    递归算法的时间复杂度分析
    MongoDB入门简单介绍
    关于用例须要多少文档以及业务用例等等
    Java连接redis的使用演示样例
    C++ String 转 char*
    MySQL和PostgreSQL 导入数据对照
    SSL连接建立过程分析(1)
    XTU OJ 1210 Happy Number (暴力+打表)
    Codeforces Round #258 (Div. 2)[ABCD]
    CreateFont具体解释
  • 原文地址:https://www.cnblogs.com/qinduanyinghua/p/11928400.html
Copyright © 2011-2022 走看看