【LeetCode第 164 场周赛】回顾

class Solution {
public:
    int minTimeToVisitAllPoints(vector<vector<int>>& points) {
        int sum=0;
        for(int i=1;i<points.size();i++){
            int x=abs(points[i][0]-points[i-1][0]);
            int y=abs(points[i][1]-points[i-1][1]);
            sum+=max(x,y);
        }return sum;
    }
};

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;
    }
};