标签：etc   sla   connect   repr   ica   blog   nts   result   strip   

题目：

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 class Solution {
 2 public:
 3     int islandPerimeter(vector<vector<int>>& grid) {
 4         int result = 0;
 5         int n = grid.size();
 6         int m = grid[0].size();
 7         for(int i=0;i<n;i++){
 8             for(int j=0;j<m;j++){
 9                 if(grid[i][j] == 1){
10                     if(i==0 || grid[i-1][j] == 0) result++;
11                     if(i==n-1 || grid[i+1][j] == 0) result++;
12                     if(j==0 || grid[i][j-1] == 0) result++;
13                     if(j==m-1 || grid[i][j+1] == 0) result++;
14                 }
15             }
16         }
17         return result;
18     }
19 };

LeetCode: 463 Island Perimeter(easy)

标签：etc   sla   connect   repr   ica   blog   nts   result   strip   

原文地址：http://www.cnblogs.com/llxblogs/p/7418484.html