C#LeetCode刷题之#463-岛屿的周长​​​​​​​(Island Perimeter)

C#LeetCode刷题之#463-岛屿的周长​​​​​​​(Island Perimeter)

问题

给定一个包含 0 和 1 的二维网格地图,其中 1 表示陆地 0 表示水域。网格中的格子水平和垂直方向相连(对角线方向不相连)。整个网格被水完全包围,但其中恰好有一个岛屿(或者说,一个或多个表示陆地的格子相连组成的岛屿)。岛屿中没有“湖”(“湖” 指水域在岛屿内部且不和岛屿周围的水相连)。格子是边长为 1 的正方形。网格为长方形,且宽度和高度均不超过 100 。计算这个岛屿的周长。

[[0,1,0,0],
 [1,1,1,0],
 [0,1,0,0],
 [1,1,0,0]]

答案: 16

解释: 它的周长是下面图片中的 16 个黄色的边:

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.

[[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:

示例

public class Program {

    public static void Main(string[] args) {
        var points = new int[,] {{0, 1, 0, 0},
                             {1, 1, 1, 0},
                             {0, 1, 0, 0},
                             {1, 1, 0, 0}};

        var res = IslandPerimeter(points);
        Console.WriteLine(res);

        Console.ReadKey();
    }

    public static int IslandPerimeter(int[,] grid) {
        if(grid.Length == 0) return 0;
        var m = grid.GetLength(0);
        var n = grid.GetLength(1);
        var res = 0;
        for(var i = 0; i < m; ++i) {
            for(var j = 0; j < n; ++j) {
                if(grid[i, j] == 0) continue;
                if(j == 0 || grid[i, j - 1] == 0) ++res;
                if(i == 0 || grid[i - 1, j] == 0) ++res;
                if(j == n - 1 || grid[i, j + 1] == 0) ++res;
                if(i == m - 1 || grid[i + 1, j] == 0) ++res;
            }
        }
        return res;
    }

}

以上给出1种算法实现,以下是这个案例的输出结果:

16

分析:

注意该题的隐含条件是给定的数组中有且仅有一个岛屿。另外可以使用减法求解,遇到岛屿+4,遇到相邻-1。

显而易见,以上算法的时间复杂度为: O(m*n)

本文由 .Net中文网 原创发布,欢迎大家踊跃转载。

转载请注明本文地址:https://www.byteflying.com/archives/3794

发表评论

登录后才能评论