[leetcode] 1582. Special Positions in a Binary Matrix

Description

Given a rows x cols matrix mat, where mat[i][j] is either 0 or 1, return the number of special positions in mat.

A position (i,j) is called special if mat[i][j] == 1 and all other elements in row i and column j are 0 (rows and columns are 0-indexed).

Example 1:

Input: mat = [[1,0,0],
              [0,0,1],
              [1,0,0]]
Output: 1
Explanation: (1,2) is a special position because mat[1][2] == 1 and all other elements in row 1 and column 2 are 0.

Example 2:

Input: mat = [[1,0,0],
              [0,1,0],
              [0,0,1]]
Output: 3
Explanation: (0,0), (1,1) and (2,2) are special positions. 

Example 3:

Input: mat = [[0,0,0,1],
              [1,0,0,0],
              [0,1,1,0],
              [0,0,0,0]]
Output: 2

Example 4:

Input: mat = [[0,0,0,0,0],
              [1,0,0,0,0],
              [0,1,0,0,0],
              [0,0,1,0,0],
              [0,0,0,1,1]]
Output: 3

Constraints:

• rows == mat.length
• cols == mat[i].length
• 1 <= rows, cols <= 100
• mat[i][j] is 0 or 1.

分析

题目的意思是：给你一个二值矩阵，找出其中的special位置，即所在的行和列其他的值都为0.这里需要用一个rows，cols数组记录行和列中1的数量，然后再遍历，遍历到1的位置的时候，利用rows，cols数组来判断其所在的行和列中的1的数量。如果能够想到这个就能写出来了。

代码

class Solution:
    def numSpecial(self, mat: List[List[int]]) -> int:
        n=len(mat)
        m=len(mat[0])
        rows=[0]*n
        cols=[0]*m
        for i in range(n):
            rows[i]=sum(mat[i])
        for i in range(n):
            for j in range(m):
                cols[j]+=mat[i][j]
        res=0
        for i in range(n):
            for j in range(m):
                if(mat[i][j]==1 and rows[i]==1 and cols[j]==1):
                    res+=1
        return res

参考文献

[LeetCode] Detaied Explanation with Code using HashMap