463. Island Perimeter

1. Description

You are given row x col grid representing a map where grid[i][j] = 1 represents land and grid[i][j] = 0 represents water.
Grid cells are connected horizontally/vertically (not diagonally). The grid is completely surrounded by water, and there is exactly one island (i.e., one or more connected land cells).
The island doesn’t have “lakes”, meaning the water inside isn’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’t exceed 100. Determine the perimeter of the island.

2. Example

Example 1:
Input: grid = [[0,1,0,0],[1,1,1,0],[0,1,0,0],[1,1,0,0]]
Output: 16
Explanation: The perimeter is the 16 yellow stripes in the image above.

Example 2:
Input: grid = [[1]]
Output: 4

Example 3:
Input: grid = [[1,0]]
Output: 4

3. Constraints

• row == grid.length
• col == grid[i].length
• 1 <= row, col <= 100
• grid[i][j] is 0 or 1.

4. Solutions

My Accepted Solution

n is the number of items in i_grid
Time complexity: O(1)
Space complexity: O(1)

class Solution
{
public:
    // int islandPerimeter(vector<vector<int>>& grid)
    int islandPerimeter(vector<vector<int>> &i_grid)
    {
        int result = 0;
        for(int row = 0; row < i_grid.size(); row++)
        {
            for(int colum = 0; colum < i_grid.front().size(); colum++)
            {
                if(i_grid[row][colum])
                {
                    if(row == 0 || !i_grid[row - 1][colum]) result++; // left
                    if(row == i_grid.size() - 1 || !i_grid[row + 1][colum]) result++; // right
                    if(colum == 0 || !i_grid[row][colum - 1]) result++; // up
                    if(colum == i_grid.front().size() - 1 || !i_grid[row][colum + 1]) result++; // down
                }
            }
        }
        
        return result;
    }
};