摘要： http://fisherlei.blogspot.com/search?q=Surrounded+Region特别说一下，里面实现bfs的code挺有意思的int k =0; 20: while(k<xIndex.size()) 21: { 22: int x = xIndex[k]; 23: int y = yIndex[k]; 24: visited[x*row +y] =1; 25: if(IsInBoundary(x, y, row, col)... 阅读全文