[LeetCode] 711. Number of Distinct Islands II_hard tag: DFS
Given a non-empty 2D array grid
of 0's and 1's, an island is a group of 1
's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.
Count the number of distinct islands. An island is considered to be the same as another if they have the same shape, or have the same shape after rotation (90, 180, or 270 degrees only) or reflection (left/right direction or up/down direction).
Example 1:
11000
10000
00001
00011
Given the above grid map, return 1
.
Notice that:
11
1
and
1
11
are considered same island shapes. Because if we make a 180 degrees clockwise rotation on the first island, then two islands will have the same shapes.
Example 2:
11100
10001
01001
01110
Given the above grid map, return 2
.
Here are the two distinct islands:
111
1
and
1
1
Notice that:
111
1
and
1
111
are considered same island shapes. Because if we flip the first array in the up/down direction, then they have the same shapes.
Note: The length of each dimension in the given grid
does not exceed 50.
Update 08/17/2018: 注意不能利用 [LeetCode] 694. Number of Distinct Islands里面的dfs function然后直接sort, 否则的话会有负数, 比如
0 1
1 1, 因此我们直接tuple(shape), 然后通过得到xMin, yMin, 然后去tuple.(这样可以避免负数的情况)
这个题目实际上就是[LeetCode] 694. Number of Distinct Islands 的变形, 我们实际上还是用那个题目的updated的做法, 用DFS去记录它的相对local 位置, 然后针对翻转和对称能够改变的加上original 位置, 总共有8 种情况, 如果original的每个坐标为(x,y), 那么其他的情况分别为(-x, y), (x,-y), (-x, -y), (y,x), (-y, x), (y, -x), (-y, -x), 只不过因为我们要的是相对位置, 那么每次在改变符号的时候要加上 Xmax or Ymax(注意的是变为local的坐标之后的max), 然后每次判断产生的local 位置在不在我们的shapes这个set里面, 如果不在的话, ans += 1, 并且将8种情况都加入到shapes 的set里面, 最后返回ans即可, 其实相对于694的题目, 只是加入了一个addIsland函数来判断是否可以翻转或者对称来跟已经有的local位置去进行比较.
1. Constraints
1) grid 可以empty, edge
2) max size will be [50*50]
3) each element will be 0 or 1
2. 思路
DFS, 因为中间有排序的过程, 所以我认为 T; O(m*n lg(m*n)) S; O(m*n)
3. Code
class Solution(object):
def numDistinctIslands2(self, grid):
if not grid or len(grid[0]) == 0 : return 0
lrc, visited, ans, shapes = [len(grid), len(grid[0])], set(), [0], set()
def dfs(i,j):
if 0<= i < lrc[0] and 0 <= j < lrc[1] and grid[i][j] and (i,j) not in visited:
visited.add((i,j))
shape.append((i, j))
dfs(i-1, j)
dfs(i+1, j)
dfs(i, j-1)
dfs(i, j+1)
def addShape(shape, shapes):
xs, ys = zip(*shape) # get xMin, yMin from original shape
xMin, yMin = min(xs), min(ys) # note: 必须通过这种方式来去得到local全部是正数的tuple
island0 = tuple(sorted((x-xMin, y - yMin) for x,y in shape))
if island0 in shapes: return
ans[0] += 1
xs, ys = zip(*island0) # get xMax, yMax from island0
xMax, yMax = max(xs) , max(ys)
island1 = tuple(sorted((-x + xMax, y ) for x, y in island0))
island2 = tuple(sorted((x, -y + yMax ) for x, y in island0))
island3 = tuple(sorted((-x + xMax, -y + yMax) for x, y in island0)) island4 = tuple(sorted((y, x) for x, y in island0))
island5 = tuple(sorted((-y + yMax, x) for x, y in island0))
island6 = tuple(sorted((y, -x + xMax) for x, y in island0))
island7 = tuple(sorted((-y + yMax, -x + xMax) for x, y in island0)) shapes |= set([island0, island1, island2, island3, island4, island5, island6, island7]) for i in range(lrc[0]):
for j in range(lrc[1]):
shape = []
dfs(i,j)
if shape:
addShape(shape, shapes)
return ans[0]
4. test cases
the test cases in the beginning.
[LeetCode] 711. Number of Distinct Islands II_hard tag: DFS的更多相关文章
- [LeetCode] 711. Number of Distinct Islands II 不同岛屿的个数之二
Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) conn ...
- [LeetCode] 694. Number of Distinct Islands
Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) conn ...
- [leetcode]694. Number of Distinct Islands你究竟有几个异小岛?
Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) conn ...
- [LeetCode] 694. Number of Distinct Islands 不同岛屿的个数
Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) conn ...
- LC 711. Number of Distinct Islands II
Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) conn ...
- [LeetCode] Number of Distinct Islands II 不同岛屿的个数之二
Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) conn ...
- [LeetCode] Number of Distinct Islands 不同岛屿的个数
Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) conn ...
- LeetCode - Number of Distinct Islands
Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) conn ...
- leetcode 200. Number of Islands 、694 Number of Distinct Islands 、695. Max Area of Island 、130. Surrounded Regions
两种方式处理已经访问过的节点:一种是用visited存储已经访问过的1:另一种是通过改变原始数值的值,比如将1改成-1,这样小于等于0的都会停止. Number of Islands 用了第一种方式, ...
随机推荐
- vim 正则替换【转】
:[range]s/from/to/[flags] range:搜索范围,如果没有指定范围,则作用于但前行. :1,10s/from/to/ 表示在第1到第10行(包含第1,第10行)之间搜索替换: ...
- 如何快速打开.iso文件(不借助专门的工具)
如何快速打开.iso文件(不借助专门的工具) 把.iso文件重命名为.rar文件,然后解压即可
- 你可能不知道的shell、bash二三事(Centos 7)
个人.bashrc: ~/.bashrc: # .bashrc # User specific aliases and functions alias rm='rm -i' alias cp='cp ...
- java中调用操作系统的命令
java.lang.Runtime类提供了exec() 方法来执行操作系统的命令. 使用静态的Runtime.getRuntime()方法可以获得当前的java应用程序对应的Runtime类的实例 R ...
- centos6.8升级python3.5.2
1.查看系统python版本 [root@myserver01 Python-]# python -V Python 2.升级3.5.2 A.下载:wget https://www.python.or ...
- POJ-2353 Ministry(动态规划)
Ministry Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4761 Accepted: 1528 Special Judg ...
- numpy的文件存储,读取 .npy .npz 文件
Numpy能够读写磁盘上的文本数据或二进制数据. 将数组以二进制格式保存到磁盘 np.load和np.save是读写磁盘数组数据的两个主要函数,默认情况下,数组是以未压缩的原始二进制格式保存在扩展名为 ...
- MapReduce计算之——hadoop中的Hello World
1. 启动集群 2. 创建input路径(有关hadoop 的命令用 "hadoop fs"),input路径并不能在系统中查找到,可以使用 “hadoop fs -ls /” ...
- MapReduce规约
深入了解Combiners编程(相当于Map端的Reduce) 每一个map可能会产生大量的输出,combiner的作用就是在map端对输出先做一次合并,以减少传输到reducer的数据量. comb ...
- Anaconda中配置Pyspark的Spark开发环境
1.windows下载并安装Anaconda集成环境 URL:https://www.continuum.io/downloads 2.在控制台中测试ipython是否启动正常 3.安装JDK 3.1 ...