Island perimeter

Array Depth-First Search Breadth-First Search Matrix

74.3% acceptance

Jan 13, 2026

7281

427

You are given row x col grid representing a map where grid[i][j] = 1 represents land and grid[i][j] = 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", meaning the water inside 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.

Solution

Rust

Time O(n²)

Space O(1)

LeetCode

solution.rs

impl Solution {
  pub fn island_perimeter(grid: Vec<Vec<i32>>) -> i32 {
    let mut perimeter = 0;
    let rows = grid.len();
    let cols = grid[0].len();
    
    for i in 0..rows {
      for j in 0..cols {
        if grid[i][j] == 1 {
          perimeter += 4;
          if i > 0 && grid[i-1][j] == 1 { perimeter -= 2; }
          if j > 0 && grid[i][j-1] == 1 { perimeter -= 2; }
        }
      }
    }
    
    perimeter
  }
}