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:
Input: [[0,1,0,0], [1,1,1,0], [0,1,0,0], [1,1,0,0]] Output: 16 Explanation: The perimeter is the 16 yellow stripes in the image below:
暴力方法,每个为1的cell,每个边检查,只要旁边是0或者是边界,就得算是周长。
class Solution {
public:
int islandPerimeter(vector<vector<int>>& grid) {
vector<vector<int>> directions{{1,0}, {0, 1}, {-1, 0}, {0, -1}};
int pre = 0;
if(grid.size() == 0 or grid[0].size() == 0)
return pre;
int row = grid.size();
int col = grid[0].size();
for(int i = 0; i<row; i++)
{
for(int j = 0; j < col; j++)
{
if(grid[i][j] == 1)
{
for(auto item : directions)
{
int newX = i + item[0];
int newY = j + item[1];
if(newX < 0 or newX >= row or newY < 0 or newY >= col
or (newX >= 0 and newX < row and newY >= 0 and newY < col and grid[newX][newY] == 0))
{
pre++;
}
}
}
}
}
return pre;
}
};
运行效果
Runtime: 408 ms, faster than 5.00% of C++ online submissions for Island Perimeter.
Memory Usage: 123.7 MB, less than 14.29% of C++ online submissions for Island Perimeter.
看别人的改进吧,
换了角度,就是看,每个cell,如果有一个为1的cell跟它相连,则总周长4个中就得减掉一条,2个为1的cell相连剪掉2,一次类推,如果4个边都跟四个为1的cell相连,则不计入周长计算,下面算法好一些些。
class Solution {
public:
int islandPerimeter(vector<vector<int>>& grid) {
/*
vector<vector<int>> directions{{1,0}, {0, 1}, {-1, 0}, {0, -1}};
int pre = 0;
if(grid.size() == 0 or grid[0].size() == 0)
return pre;
int row = grid.size();
int col = grid[0].size();
for(int i = 0; i<row; i++)
{
for(int j = 0; j < col; j++)
{
if(grid[i][j] == 1)
{
for(auto item : directions)
{
int newX = i + item[0];
int newY = j + item[1];
if(newX < 0 or newX >= row or newY < 0 or newY >= col
or (newX >= 0 and newX < row and newY >= 0 and newY < col and grid[newX][newY] == 0))
{
pre++;
}
}
}
}
}
return pre;
*/
int n = grid.size();
int m = grid[0].size();
if(n==1 && m==1 && grid[0][0]==1)
return 4;
int a,b,c,d;
a=b=c=d=0;
int count = 0;
int elimit_edge = 0;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(grid[i][j]==0)
continue;
else{
count++;
int cnt=0;
if(j-1>=0 && grid[i][j-1]==1)
elimit_edge++;
if(i-1>=0 && grid[i-1][j]==1)
elimit_edge++;
if(i+1<n && grid[i+1][j]==1)
elimit_edge++;
if(j+1<m && grid[i][j+1]==1)
elimit_edge++;
}
}
}
int ans = count*4;
return ans - elimit_edge;
}
};
运行效果
Runtime: 164 ms, faster than 21.69% of C++ online submissions for Island Perimeter.
Memory Usage: 95.9 MB, less than 14.29% of C++ online submissions forIsland Perimeter.