LeetcodeChallenge/1582_Special_Positions_in_a_Binary_Matrix.cpp at master · KeremTAN/LeetcodeChallenge · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
class Solution {
public:
    int numSpecial(vector<vector<int>>& mat) {
        int ret=0, x;
        bool isOk=true;
        for(int i=0; i<mat.size(); i++){
            for(int j=0; j<mat[0].size(); j++){
                if(mat[i][j]==1){
                    isOk=true;
                    x=j+1;
                    while(x<mat[0].size())
                        if(mat[i][x++]==1){
                            isOk=false;
                            break;
                        }

                    if(!isOk) break;

                    x=j-1;
                    while(x>-1)
                        if(mat[i][x--]==1){
                            isOk=false;
                            break;
                        }

                    if(!isOk) break;

                    x=i+1;
                    while(x<mat.size())
                        if(mat[x++][j]==1){
                            isOk=false;
                            break;
                        }

                    if(!isOk) break;

                    x=i-1;
                    while(x>-1)
                        if(mat[x--][j]==1){
                            isOk=false;
                            break;
                        }

                    if(!isOk) break;

                    ret++;
                }
                if(ret==mat.size()) break;

            }
        }
        return ret;
    }
};