C-data-structure-/void___problem2.cpp at main · Abdullah-Tahir/C-data-structure- · 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
55
56
57
58
59
60
61
#include <iostream>
using namespace std;
#define rows 4
#define cols 5
int r[4] = { 0, 0, 0, 1 };
int c[4] = { 1, 1, 0, 0 };

bool checker(int x, int y, int matrix[][cols])
{
    if (x >= 0 && x <= rows && y >= 0 &&
        y <= cols && matrix[x][y] == 1)
        return true;
    return false;
}


void depthfinding(int i, int j, int k[][cols])
{
    //i am using this DPS alogo to  make sure that all the 1 at the boundry of the matrix gets remove so that i can get the zeros better
    k[i][j] = 1;
    for (int g = 0; g < 4; g++)
        if (checker(i + r[g], j + c[g], k))
            depthfinding(i + r[g], j + c[g], k);
}

int surrdoing_zero(int matrix[][cols])
{
    //

    for (int i = 0; i < cols; i++)
        if (matrix[rows - 1][i] == 1)
            depthfinding(rows - 1, i, matrix);

    for (int i = 0; i < cols; i++)
        if (matrix[0][i] == 1)
            depthfinding(0, i, matrix);
    for (int i = 0; i < rows; i++)
        if (matrix[i][cols - 1] == 1)
            depthfinding(i, cols - 1, matrix);
    for (int i = 0; i < rows; i++)
        if (matrix[i][0] == 1)
            depthfinding(i, 0, matrix);


    int final = 0;
    for (int i = 0; i < rows; i++)
        for (int j = 0; j < cols; j++)
            if (matrix[i][j] == 1)
                final++;
    return final;
}

int main()
{
    int matrix[][cols] = { { 0, 0, 0, 0, 0 },
                     { 0, 0, 0, 0, 0 },
                     { 0, 1, 0, 1, 0 },
                     { 0, 0, 0, 0, 0 } };
    cout << surrdoing_zero(matrix) << endl;
    return 0;
}