Island Perimeter

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 a side length of 1. The grid is rectangular, width and height don't exceed 100. Determine the perimeter of the island.

Example 1:

Input: grid = {{0,1,0,0},{1,1,1,0},{0,1,0,0},{1,1,0,0}}
Output: 16

Approach

Java

public class IslandPerimeter {
    public static void main(String[] args) {
        int grid[][] = { { 0, 1, 0, 0 }, { 1, 1, 1, 0 }, 
                    { 0, 1, 0, 0 }, { 1, 1, 0, 0 } };
        System.out.println(islandPerimeter(grid));
    }
    static int count(int[][] grid, int i, int j) {
        int cnt = 0;
        if (i > 0 && grid[i - 1][j] == 1)
            cnt++;
        if (j > 0 && grid[i][j - 1] == 1)
            cnt++;
        if (i < grid.length - 1 && grid[i + 1][j] == 1)
            cnt++;
        if (j < grid[0].length - 1 && grid[i][j + 1] == 1)
            cnt++;
        return cnt;
    }
    static int islandPerimeter(int[][] grid) {
        int res = 0;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[0].length; j++)
                if (grid[i][j] == 1)
                    res += (4 - count(grid, i, j));
        }
        return res;
    }
}

C++

#include <bits/stdc++.h>
using namespace std;

int count(vector<vector<int>> &grid,int i,int j)
{
        int cnt=0;
        if(i>0&&grid[i-1][j])
               cnt++;
        if(j>0&&grid[i][j-1])
               cnt++;
        if(i<grid.size()-1&&grid[i+1][j])
               cnt++;
        if(j<grid[0].size()-1&&grid[i][j+1])
               cnt++;
        return cnt;
}
int islandPerimeter(vector<vector<int>>& grid) 
{
        int res=0;
        for(int i=0;i<grid.size();i++)
        {
            for(int j=0;j<grid[0].size();j++)
                if(grid[i][j])
                   res+=(4-count(grid,i,j));
        }
        return res;
}
int main()
{
    vector<vector<int>>grid ={{0,1,0,0},
                              {1,1,1,0},
                              {0,1,0,0},
                              {1,1,0,0}};
   cout<<islandPerimeter(grid);
   return 0;
}