NO.4_463. Island Perimeter

463. Island Perimeter

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:

//参考解

//总数减错误计算的

int islandPerimeter(vector<vector<int>>& grid) {
        int count=0, repeat=0;
        for(int i=0;i<grid.size();i++)
        {
            for(int j=0; j<grid[i].size();j++)
                {
                    if(grid[i][j]==1)
                    {
                        count ++;
                        if(i!=0 && grid[i-1][j] == 1) repeat++;
                        if(j!=0 && grid[i][j-1] == 1) repeat++;
                    }
                }
        }
		
        return 4*count-repeat*2;
    }

//解1(超时)

class Solution {
public:
    int islandPerimeter(vector<vector<int>>& grid)
    {
        int a=0;
        for(int i=0;i<grid.size();i++)
        {
            for(int j=0; j<grid[i].size();j++)
            {
                if(grid[i][j]==1)//找到岛
                {
                    if(grid[i-1][j]==0||(i-1)<0)a++;
                    if(grid[i][j-1]==0||(j-1)<0)a++;
                    if(grid[i+1][j]==0||(i+1)==grid.size())a++;
                    if(grid[i][j+1]==0||(j+1)==grid[i].size())a++;
                }
            }
        }
       
        std::cout<<a<<std::endl;
        return a;
    }
};

//解2

class Solution {
public:
    int islandPerimeter(vector<vector<int>>& grid)
    {
        int a=0;
		
		//行判断
        for(int i=0;i<grid.size();i++)
        {
           for(int j=1; j<grid[i].size();j++)
            {
                if((grid[i][j]^grid[i][j-1]))a++;//后一个和前一个不同则为墙
            }
			//判断头尾
           if(grid[i][0]==1)a=a+1;
           if(grid[i][grid[i].size()-1]==1)a=a+1;
        }
		
        //列判断
        for(int j=0;j<grid[0].size();j++)
        {
            
           for(int i=1; i<grid.size();i++)
            {
                if((grid[i][j]^grid[i-1][j]))a++;
            }
             if(grid[0][j]==1)a=a+1;
             if(grid[grid.size()-1][j]==1)a=a+1;
        }
    
        return a;
    }
};

//解3（超时）
//找到岛后，遍历周围点

class Solution {
public:
    int islandPerimeter(vector<vector<int>>& grid)
    {
        int a=0;
        int begin_i;
        int begin_j;
       
       //二维情况
        vector<int> i_;
        vector<int> j_;
        int array_num=0;//队列中的元素个数
        bool flag[grid.size()][grid[0].size()];//遍历标识位，避免重复遍历
        memset(flag,0,sizeof(flag));//二维数组初始化
        int i1=0;
        int j1=0;
        
        for( i1=0;i1<grid.size();i1++)//找到搜索起始点
        {
            for( j1=0; j1<grid[i1].size();j1++)
            {
                if(grid[i1][j1])
                {
                   //std::cout<<"(i,j)：  "<<"("<<i1<<","<<j1<<")"<<std::endl;
                   begin_i=i1; 
                   begin_j=j1;
                   break;
                }
            }
            
            if(grid[i1][j1])
            {
                break;
            }
           
        }


        flag[begin_i][begin_j]=1;
        i_.push_back(begin_i);
        j_.push_back(begin_j);
        array_num++;
        while(array_num)//队列中没有元素再退出
        {
            int i=i_[array_num-1];
            int j=j_[array_num-1];
            array_num--;
            i_.pop_back();
            j_.pop_back();
            
            //1
            if(i+1<grid.size())//不是边界
            {
                if(flag[i+1][j]==1)//遍历过此处
                {
                    
                }
                else if(grid[i+1][j])//岛屿
                {
                     flag[i+1][j]=1;
                     i_.push_back(i+1);
                     j_.push_back(j);
                     array_num++;
                     //std::cout<<"(i+1,j)：  "<<"("<<i+1<<","<<j<<")"<<std::endl;
                }
                else
                {
                    //flag[i+1][j]=1;
                    a++;
                    //std::cout<<" [i+1] ";
                }
                
            }
            else//是边界
            {
                a++;
                //std::cout<<" [i+1]_ ";
            }
            //2
            if(i-1>-1)//不是边界
            {
                if(flag[i-1][j]==1)//遍历过此处
                {
                    
                }
                else if(grid[i-1][j])//岛屿
                {
                     flag[i-1][j]=1;
                     i_.push_back(i-1);
                     j_.push_back(j);
                     array_num++;
                     //std::cout<<"(i-1,j)：  "<<"("<<i-1<<","<<j<<")"<<std::endl;
                }
                else
                {
                    a++;
                }
                
            }
            else//是边界
            {
                a++;
            }
            
            //3
             if(j-1>-1)//不是边界
            {
                if(flag[i][j-1]==1)//遍历过此处
                {
                    
                }
                else if(grid[i][j-1])//岛屿
                {
                     flag[i][j-1]=1;
                     i_.push_back(i);
                     j_.push_back(j-1);
                     array_num++;
                }
                else
                {
                    a++;
                }
                
            }
            else//是边界
            {
                a++;
            }
            //4
             if(j+1<grid[0].size())//不是边界
            {
                if(flag[i][j+1]==1)//遍历过此处
                {
                    
                }
                else if(grid[i][j+1])//岛屿
                {
                     flag[i][j+1]=1;
                     i_.push_back(i);
                     j_.push_back(j+1);
                     array_num++;
                }
                else
                {
                   a++;
                }
                
            }
            else//是边界
            {
                a++;
            }
            
        }
       
        return a;
    }
};