宽度优先遍历
LUCASYAN个
这个作者很懒,什么都没留下…
展开
-
542. 01 Matrix 寻找最近的0 重点 BFS 动态规划
Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.The distance between two adjacent cells is 1.Example 1: Input:0 0 00 1 00 0 0Output:0 0 00 1 00原创 2017-09-15 10:52:59 · 599 阅读 · 0 评论 -
529. Minesweeper 扫雷游戏 DFS BFS
Let's play the minesweeper game (Wikipedia, online game)!You are given a 2D char matrix representing the game board. 'M' represents an unrevealed mine, 'E' represents an unrevealed empty square,原创 2017-09-06 14:23:56 · 544 阅读 · 0 评论 -
210. Course Schedule II
There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordin原创 2017-09-05 00:06:08 · 160 阅读 · 0 评论 -
310. Minimum Height Trees
Given a string s and a string t, check if s is subsequence of t.You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) strin原创 2017-09-05 00:06:28 · 188 阅读 · 0 评论 -
207. Course Schedule
3原创 2017-09-06 14:22:59 · 143 阅读 · 0 评论 -
417. Pacific Atlantic Water Flow
4原创 2017-09-06 14:23:10 · 147 阅读 · 0 评论 -
200. Number of Islands
5原创 2017-09-06 14:23:22 · 154 阅读 · 0 评论 -
513. Find Bottom Left Tree Value 树 BFS
You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each subsequences consist of at least 3 consecutive integers.原创 2017-09-05 00:06:53 · 190 阅读 · 0 评论 -
515. Find Largest Value in Each Tree Row 找到数每一层的最大值
Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of t原创 2017-09-05 00:07:20 · 216 阅读 · 0 评论 -
301. Remove Invalid Parentheses
6原创 2017-09-06 14:23:33 · 213 阅读 · 0 评论