欢迎来到PJCK的博客

随笔分类 -  数据结构与算法----搜索----DFS

(BFS DFS 并查集) leetcode 547. Friend Circles
摘要：There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct 阅读全文
posted @ 2019-05-17 16:27 PJCK 阅读(247) 评论(0) 推荐(0)
(BFS DFS 图的遍历) leetcode 841. Keys and Rooms
摘要：There are N rooms and you start in room 0. Each room has a distinct number in 0, 1, 2, ..., N-1, and each room may have some keys to access the next r 阅读全文
posted @ 2019-05-17 09:56 PJCK 阅读(150) 评论(0) 推荐(0)
(BFS DFS 图的遍历) leetcode 733. Flood Fill
摘要：An image is represented by a 2-D array of integers, each integer representing the pixel value of the image (from 0 to 65535). Given a coordinate (sr, 阅读全文
posted @ 2019-05-16 20:58 PJCK 阅读(129) 评论(0) 推荐(0)
(DFS BFS 图的遍历) leetcode 695. Max Area of Island
摘要：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.) Yo 阅读全文
posted @ 2019-05-15 08:59 PJCK 阅读(152) 评论(0) 推荐(0)
(N叉树 递归) leetcode 590. N-ary Tree Postorder Traversal
摘要：Given an n-ary tree, return the postorder traversal of its nodes' values. For example, given a 3-ary tree: Return its postorder traversal as: [5,6,3,2 阅读全文
posted @ 2019-04-26 19:15 PJCK 阅读(247) 评论(0) 推荐(0)
(N叉树 递归) leetcode589. N-ary Tree Preorder Traversal
摘要：Given an n-ary tree, return the preorder traversal of its nodes' values. For example, given a 3-ary tree: Return its preorder traversal as: [1,3,5,6,2 阅读全文
posted @ 2019-04-26 19:12 PJCK 阅读(154) 评论(0) 推荐(0)
(N叉树 DFS 递归 BFS) leetcode 559. Maximum Depth of N-ary Tree
摘要：Given a n-ary 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 le 阅读全文
posted @ 2019-04-26 18:44 PJCK 阅读(112) 评论(0) 推荐(0)
(二叉树 DFS 递归) leetcode 112. Path Sum
摘要：Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. N 阅读全文
posted @ 2019-04-19 20:38 PJCK 阅读(165) 评论(0) 推荐(0)
(二叉树 DFS 递归) leetcode 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 @ 2019-04-19 20:28 PJCK 阅读(107) 评论(0) 推荐(0)
(二叉树 递归) leetcode 144. Binary Tree Preorder Traversal
摘要：Given a binary tree, return the preorder traversal of its nodes' values. Example: Follow up: Recursive solution is trivial, could you do it iterativel 阅读全文
posted @ 2019-04-17 18:43 PJCK 阅读(174) 评论(0) 推荐(0)
(二叉树 递归 DFS) leetcode 100. Same Tree
摘要：Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally ident 阅读全文
posted @ 2019-04-17 17:35 PJCK 阅读(100) 评论(0) 推荐(0)
(二叉树 BFS DFS) leetcode 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 @ 2019-04-16 09:24 PJCK 阅读(129) 评论(0) 推荐(0)
(二叉树 BFS DFS) leetcode 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 @ 2019-04-16 09:20 PJCK 阅读(138) 评论(0) 推荐(0)
(BFS) leetcode 690. Employee Importance
摘要：690. Employee Importance Easy 377369FavoriteShare 690. Employee Importance Easy 377369FavoriteShare Easy You are given a data structure of employee in 阅读全文
posted @ 2019-04-15 20:33 PJCK 阅读(129) 评论(0) 推荐(0)
(BFS/DFS) leetcode 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 @ 2019-04-15 19:47 PJCK 阅读(147) 评论(0) 推荐(0)
(DFS 图的遍历) P1605 迷宫 洛谷
摘要：题目背景 迷宫 【问题描述】 给定一个N*M方格的迷宫，迷宫里有T处障碍，障碍处不可通过。给定起点坐标和 终点坐标，问: 每个方格最多经过1次，有多少种从起点坐标到终点坐标的方案。在迷宫 中移动有上下左右四种方式，每次只能移动一个方格。数据保证起点上没有障碍。 输入样例 输出样例 【数据规模】 1≤ 阅读全文
posted @ 2019-03-20 18:50 PJCK 阅读(284) 评论(0) 推荐(0)