leetcode每日一题第133天

class Solution {
public:
    int direction[4][2] = {0,1,0,-1,-1,0,1,0};//上下左右
    int islandPerimeter(vector<vector<int>>& grid) {
        int result = 0;
        for(int i = 0;i < grid.size();i++)
        {
            for(int j = 0;j < grid[0].size();j++)
            {
                if(grid[i][j] == 1)
                {
                    for(int k = 0;k < 4;k++)
                    {
                        int x = i + direction[k][0];
                        int y = j + direction[k][1];
                        if(x < 0 || x >= grid.size() || y < 0 || y >= grid[0].size() || grid[x][y] == 0)
                        {
                            result++;
                        }
                    }
                }
            }
        }
        return result;
    }
};