leetcode 1582. Special Positions in a Binary Matrix（python）_python 1582. special positions in a binary matrix-CSDN博客

本文链接：https://blog.csdn.net/wang7075202/article/details/117592448

该博客讨论了一个算法问题，即在给定的二维矩阵中找出特殊位置的数量。特殊位置是指矩阵中值为1的元素，其所在行和列的所有其他元素均为0。通过计算每一行和每一列的和，然后遍历矩阵找到满足条件的特殊位置，最终得出结果。文章提供了Python代码实现，并展示了不同输入矩阵的例子和运行效率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

描述

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

Note:

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

解析

根据题意，就是要找出 mat 中的特殊数字有几个。特殊数字就是必须为 1 且所在的行和列其他位置都为 0 。直接使用内置函数，计算出来水平和垂直两个方向的和 h 和 v ，然后遍历 mat 中的元素，只要该元素为 1 且所在行和列的元素和为 1 ，那就将结果 result 加一，遍历结束即可得到结果。

解答

class Solution(object):
    def numSpecial(self, mat):
        """
        :type mat: List[List[int]]
        :rtype: int
        """
        import numpy as np
        mat = np.array(mat)
        v = np.sum(mat,0)
        h = np.sum(mat,1)
        result = 0
        for i in range(len(mat)):
            if h[i]!=1:
                continue
            for j in range(len(mat[0])):
                if mat[i][j]==1 and v[j]==1 and h[i]==1:
                    result += 1
                    break
        return result

运行结果

Runtime: 184 ms, faster than 20.65% of Python online submissions for Special Positions in a Binary Matrix.
Memory Usage: 26 MB, less than 5.43% of Python online submissions for Special Positions in a Binary Matrix.

原题链接：https://leetcode.com/problems/special-positions-in-a-binary-matrix/

您的支持是我最大的动力