Island Perimeter
来源:互联网 发布:炒邮票是网络传销吗 编辑:程序博客网 时间:2024/05/22 09:38
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
我的思路,就是将现有的矩阵用零填充,然后先按行看,如果出现前后数字不一致则给周长加一,再按列看,上下数字不一致给周长加一。
class Solution(object): def islandPerimeter(self, grid): """ :type grid: List[List[int]] :rtype: int """ perimeter = 0 tmp = [[0 for i in range(len(grid[0])+2)]] for i in range(len(grid)): tmp.append([0] + grid[i] + [0]) tmp.append([0 for i in range(len(grid[0])+2)]) for i in range(len(tmp) - 1): for j in range(len(tmp[0]) - 1): if tmp[i][j] != tmp[i][j+1]: perimeter += 1 if tmp[i][j] != tmp[i+1][j]: perimeter += 1 return perimeter
接下来看一下大神们的解法:
0 0
- Island Perimeter
- Island Perimeter
- Island Perimeter
- Island Perimeter
- Island Perimeter
- Island Perimeter
- Island Perimeter
- Island Perimeter
- Island Perimeter
- Island Perimeter
- Island Perimeter
- Island Perimeter
- 463. Island Perimeter
- 463. Island Perimeter
- leetcode 463. Island Perimeter
- [LeetCode]Island Perimeter -Python
- leetcode 463. Island Perimeter
- leetcode Island Perimeter
- 问题描述大概如下:在一个二维数组中,每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序。 请完成一个函数,输入这样的一个二维数组和一个整数,判断数组中是否含有该整数。
- windows gpu tensorflow anaconda
- Java学习笔记(一)对象数组的初始化
- 基于Token的WEB后台认证机制
- 【AngularJS】ng-model-options指令
- Island Perimeter
- leetcode122~Best Time to Buy and Sell Stock II
- 斯坦福机器学习网易公开课笔记13a
- Java基础之反射
- Spring官方文档翻译(1~6章)
- 六、java线程及多线程
- moment.js 是個處理跟時間有關的 lib
- 从leetcode(hard)135说开去
- 蓝桥杯