[LeetCode]463. Island Perimeter

题目描述

思路

对于值为1的格子，判断边是否是周长的一部分，条件是，边是grid的边界或者相邻的格子值为0

代码

class Solution {public:    int islandPerimeter(vector<vector<int>>& grid) {        int row = grid.size(), col = grid[0].size();        int count = 0;        for (int i = 0; i < row; ++i) {            for (int j = 0; j < col; ++j) {                if (grid[i][j]){                    if (i == 0 || grid[i - 1][j] == 0){                        ++count;                    }                    if (i == row - 1 || grid[i + 1][j] == 0){                        ++count;                    }                    if (j == 0 || grid[i][j - 1] == 0){                        ++count;                    }                    if (j == col - 1 || grid[i][j + 1] == 0){                        ++count;                    }                }            }        }        return count;    }};