<p>You are given <code>row x col</code> <code>grid</code> representing a map where <code>grid[i][j] = 1</code> represents&nbsp;land and <code>grid[i][j] = 0</code> represents water.</p>

<p>Grid cells are connected <strong>horizontally/vertically</strong> (not diagonally). The <code>grid</code> is completely surrounded by water, and there is exactly one island (i.e., one or more connected land cells).</p>

<p>The island doesn&#39;t have &quot;lakes&quot;, meaning the water inside isn&#39;t connected to the water around the island. One cell is a square with side length 1. The grid is rectangular, width and height don&#39;t exceed 100. Determine the perimeter of the island.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img src="https://assets.leetcode.com/uploads/2018/10/12/island.png" style="width: 221px; height: 213px;" />
<pre>
<strong>Input:</strong> grid = [[0,1,0,0],[1,1,1,0],[0,1,0,0],[1,1,0,0]]
<strong>Output:</strong> 16
<strong>Explanation:</strong> The perimeter is the 16 yellow stripes in the image above.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> grid = [[1]]
<strong>Output:</strong> 4
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> grid = [[1,0]]
<strong>Output:</strong> 4
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>row == grid.length</code></li>
	<li><code>col == grid[i].length</code></li>
	<li><code>1 &lt;= row, col &lt;= 100</code></li>
	<li><code>grid[i][j]</code> is <code>0</code> or <code>1</code>.</li>
	<li>There is exactly one island in <code>grid</code>.</li>
</ul>

class Solution {
    int visited[101][101] = {0};
    vector<vector<int>> g;
public:
    int per = 0;
    int X = 0,  Y = 0;

    int getGrid(int x, int y)
    {
        if (x < 0 || y < 0 || x >= X || y>=Y )
            return 0;
        else
            return g[y][ x];
    }
    void search(int x, int y)
    {
        if ( x < 0 || y < 0 || y >= Y || x >= X)
        {
            //cout << "\t" << x << ", " << y << "OOB\n";
            return;
        }

        
        if (getGrid(x, y) == 0)
        {
            //cout << "\t" << x << ", " << y << " " << g[y][x] << getGrid(x, y)<<"Water\n <<";
            return;
        }
        
        else //we're in land
        {
            if (visited[y][x] == 1)
                return;
            ////cout << x << " " << y << " " << getGrid(y, x) << endl;
            visited[y][x] = 1;
            if (getGrid(x+1, y) == 0)
            {
                //cout << x <<", " << y << "> " << "W" << endl;  
                per++;
            }
            else
            {
                //cout << x <<", " << y << "> " << "L" << endl;
                search(x+1, y);
            }

            if (getGrid(x-1, y) == 0)
            {
                //cout << x <<", " << y << "< " << "W" << endl;
                per++;
            }
            else
            {
                //cout << x <<", " << y << "< " << "L" << endl;
                search(x-1, y);
            }
            if (getGrid(x, y+1) == 0)
            {
                //cout << x <<", " << y << "v " << "W" << endl;
                per++;
            }
            else
            {
                //cout << x <<", " << y << "v " << "L" << endl;
                search(x, y+1);
            }
            if (getGrid(x, y-1) == 0)
            {
                //cout << x <<", " << y << "^ " << "W" << endl;
                per++;
            }
            else
            {
                //cout << x <<", " << y << "^ " << "L" << endl;
                search(x, y-1);
            }
            
        }
    }

    int islandPerimeter(vector<vector<int>>& grid) {
        Y = grid.size();
        X = grid[0].size();
        g = grid;
        //cout << "X: " << X << "Y: " << Y << endl;

        for (size_t i = 0; i < Y; i++)
            for (size_t j = 0; j < X; j++)
                if (grid[i][j] == 1)
                {
                    //cout << "Start: " << j << " " << i << endl;
                    search(j, i);
                    break;
                }
        return per;
    }
};

69377