463. Island Perimeter

You are given a map in form of a two-dimensional integer grid where 1 represents land and 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" (water inside that 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.

Example:

[[0,1,0,0],
 [1,1,1,0],
 [0,1,0,0],
 [1,1,0,0]]

Answer: 16
Explanation: The perimeter is the 16 yellow stripes in the image below:

如果一个方块是1则加4,考虑可能有相邻的边导致多加，一个格子如果有一个邻居，则相邻的边会加两次。因此，遇到1的格子，要加4减相邻的1格子数。

 class Solution {
    struct offset{
        int x;
        int y;
    };
    offset moves[4]={{1,0},{0,1},{-1,0},{0,-1}};
    int  neighbors(int i,int j,vector<vector<int>>& grid)
    {
        int k,cnt=0;
        int m=grid.size(); int n=grid[0].size();
        for(k=0;k<4;k++)
         {
              int xx=i+moves[k].x;
              int yy=j+moves[k].y;
              if(xx>=0&&xx<m&&yy>=0&&yy<n&&grid[xx][yy])
                      cnt++;
        }
        return cnt;
    }
public:
    int islandPerimeter(vector<vector<int>>& grid) {
      int cnt=0;
      int m=grid.size();
      if(!m) return cnt;
      int n=grid[0].size();
      int i,j,k;
      vector<vector<int>> visited(m);
      for(i=0;i<m;i++)
      visited[i].resize(n);
      for(i=0;i<m;i++)
      {
          for(j=0;j<n;j++)
          {
              if(grid[i][j])
              {
                  cnt+=4-neighbors(i,j,grid);
              }
          }
      }
      return cnt;
    }
};