1582_special_positions_in_a_binary_matrix.py

class Solution:
    def numSpecial(self, mat: List[List[int]]) -> int:
        row_sum = [sum(row) for row in mat]
        ans = 0
        for i in range(len(row_sum)):
            if row_sum[i] == 1:
                index = mat[i].index(1)
                tmp = [mat[j][index] for j in range(len(mat))]
                if sum(tmp) == 1:
                    ans += 1
        return ans

'''
    This is my personal record of solving Leetcode Problems. 
    If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
    Copyright (C) 2020-2022  mengxinayan

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
'''