程式語言 - LeetCode - C++ - 1582. Special Positions in a Binary Matrix



參考資訊:
https://github.com/keineahnung2345/leetcode-cpp-practices/blob/master/1582.%20Special%20Positions%20in%20a%20Binary%20Matrix.cpp

題目:


解答:

class Solution {
public:
    int numSpecial(vector<vector<int>>& mat) {
        int m_size = mat.size();
        int n_size = mat[0].size();

        vector<int> m(m_size, 0);
        vector<int> n(n_size, 0);

        for (int i = 0; i < m_size; ++i) {
            for (int j = 0; j < n_size; ++j) {
                if (mat[i][j] == 1) {
                    m[i] += 1;
                    n[j] += 1;
                }
            }
        }

        int r = 0;

        for (int i = 0; i < m_size; ++i) {
            for (int j = 0; j < n_size; ++j) {
                if ((mat[i][j] == 1) && (m[i] == 1) && (n[j] == 1)) {
                    r += 1;
                }
            }
        }

        return r;
    }
};