随笔分类 -  leetcode_bfs

207. Course Schedule
摘要：There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have t 阅读全文
posted @ 2017-10-24 14:42 daniel456 阅读(118) 评论(0) 推荐(0) 编辑
542. 01 Matrix
摘要：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: 阅读全文
posted @ 2017-10-24 14:25 daniel456 阅读(188) 评论(0) 推荐(0) 编辑
200. Number of Islands
摘要：Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacen 阅读全文
posted @ 2017-10-24 14:05 daniel456 阅读(134) 评论(0) 推荐(0) 编辑
690. Employee Importance
摘要：You are given a data structure of employee information, which includes the employee's unique id, his importance value and his directsubordinates' id. 阅读全文
posted @ 2017-10-23 19:49 daniel456 阅读(129) 评论(0) 推荐(0) 编辑
102. Binary Tree Level Order Traversal
摘要：Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree [3 阅读全文
posted @ 2017-10-23 11:02 daniel456 阅读(104) 评论(0) 推荐(0) 编辑
103. Binary Tree Zigzag Level Order Traversal
摘要：Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and 阅读全文
posted @ 2017-10-23 11:00 daniel456 阅读(93) 评论(0) 推荐(0) 编辑
515. Find Largest Value in Each Tree Row
摘要：You need to find the largest value in each row of a binary tree. Example: 方法二： 阅读全文
posted @ 2017-10-23 08:14 daniel456 阅读(211) 评论(0) 推荐(0) 编辑
199. Binary Tree Right Side View
摘要：Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. For exa 阅读全文
posted @ 2017-10-23 07:56 daniel456 阅读(159) 评论(0) 推荐(0) 编辑
513. Find Bottom Left Tree Value
摘要：Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Example 2: 阅读全文
posted @ 2017-10-22 21:25 daniel456 阅读(106) 评论(0) 推荐(0) 编辑
101. Symmetric Tree
摘要：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文
posted @ 2017-10-22 17:20 daniel456 阅读(103) 评论(0) 推荐(0) 编辑
637. Average of Levels in Binary Tree
摘要：Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array. Example 1: 阅读全文
posted @ 2017-10-22 17:05 daniel456 阅读(110) 评论(0) 推荐(0) 编辑
226 Invert Binary Tree
摘要：nvert a binary tree. to 方法二：BfS 阅读全文
posted @ 2017-10-22 16:52 daniel456 阅读(133) 评论(0) 推荐(0) 编辑
404. Sum of Left Leaves
摘要：Find the sum of all left leaves in a given binary tree. Example: 方法二： 阅读全文
posted @ 2017-10-21 23:09 daniel456 阅读(114) 评论(0) 推荐(0) 编辑
111. Minimum Depth of Binary Tree
摘要：Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文
posted @ 2017-10-21 22:26 daniel456 阅读(133) 评论(0) 推荐(0) 编辑
107. Binary Tree Level Order Traversal II
摘要：Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For 阅读全文
posted @ 2017-10-21 17:43 daniel456 阅读(104) 评论(0) 推荐(0) 编辑
104. Maximum Depth of Binary Tree
摘要：Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文
posted @ 2017-10-21 17:37 daniel456 阅读(129) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示