1 Star 0 Fork 0

xiangxiang/LeetCode-NOTES

Create your Gitee Account
Explore and code with more than 13.5 million developers,Free private repositories !:)
Sign up
文件
Clone or Download
solution.cpp 790 Bytes
Copy Edit Raw Blame History
默然 authored 7 years ago . update all algorithms.
class Solution
{
public:
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)
{
if( j-1 < 0 || grid[i][j-1] == 0)
result += 1;
if( j+1 == grid[0].size() || grid[i][j+1] == 0)
result += 1;
if( i-1 < 0 || grid[i-1][j] == 0)
result += 1;
if( i+1 == grid.size() || grid[i+1][j] == 0)
result += 1;
}
}
}
return result;
}
};
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/xiangxiang920/LeetCode-NOTES.git
git@gitee.com:xiangxiang920/LeetCode-NOTES.git
xiangxiang920
LeetCode-NOTES
LeetCode-NOTES
master

Search