dfs/bfs
文章平均质量分 76
_TCgogogo_
这个作者很懒,什么都没留下…
展开
-
LeetCode 1765 Map of Highest Peak (多源点BFS 推荐)
题目分析:多源点bfs,将水的位置都作为源点,每次向四个方向扩散,高度加1,开始一直在想这么做有没有可能出现违反高度差不超过1的限制。其实是不可能的,因为bfs是用队列维护的,特点是先进先出,换句话说,假设当前队首的高度为h,队尾的高度为h+1,不可能出现队尾高度仍为h但队尾高度为h+2的情况,因为处理h+2的前提是所有高度为h的都已处理完毕。题目大意:n*m的矩阵,水的高度为0,地的高度大于0,且要求相邻两个高度差不能超过1,求一种排列方式使得其中的最大值最大。65ms,时间击败91.58%原创 2022-09-07 23:44:49 · 346 阅读 · 1 评论 -
LeetCode 994 Rotting Oranges (bfs 推荐)
You are given anm x ngridwhere each cell can have one of three values:0representing an empty cell, 1representing a fresh orange, or 2representing a rotten orange.Every minute, any fresh orange that is4-directionally adjacentto a rotten orange ...原创 2022-05-07 16:19:35 · 274 阅读 · 0 评论 -
LeetCode 652 Find Duplicate Subtrees (dfs 推荐)
Given therootof a binary tree, return allduplicate subtrees.For each kind of duplicate subtrees, you only need to return the root node of anyoneof them.Two trees areduplicateif they have thesame structurewith thesame node values.Example 1:...原创 2022-02-28 20:15:17 · 179 阅读 · 0 评论 -
LeetCode 430 Flatten a Multilevel Doubly Linked List (dfs 链表)
You are given a doubly linked list, which contains nodes that have a next pointer, a previous pointer, and an additionalchild pointer. This child pointer may or may not point to a separate doubly linked list, also containing these special nodes. These chi.原创 2022-02-28 20:03:45 · 348 阅读 · 0 评论 -
LeetCode 1609 Even Odd Tree (bfs)
A binary tree is namedEven-Oddif it meets the following conditions:The root of the binary tree is at level index0, its children are at level index1, their children are at level index2, etc. For everyeven-indexedlevel, all nodes at the level have...原创 2022-02-25 12:14:00 · 150 阅读 · 0 评论 -
LeetCode 698 Partition to K Equal Sum Subsets (dfs 剪枝)
Given an integer array nums and an integer k, return true if it is possible to divide this array into k non-empty subsets whose sums are all equal.Example 1:Input: nums = [4,3,2,3,5,2,1], k = 4Output: trueExplanation: It is possible to divide it int原创 2022-02-18 21:01:14 · 290 阅读 · 0 评论 -
LeetCode 1190 Reverse Substrings Between Each Pair of Parentheses (dfs 栈 推荐)
You are given a stringsthat consists of lower case English letters and brackets.Reverse the strings in each pair of matching parentheses, starting from the innermost one.Your result shouldnotcontain any brackets.Example 1:Input: s = "(abcd)"O...原创 2022-02-04 18:02:23 · 157 阅读 · 0 评论 -
LeetCode 173 Binary Search Tree Iterator ()
Implement theBSTIteratorclass that represents an iterator over thein-order traversalof a binary search tree (BST):BSTIterator(TreeNode root)Initializes an object of theBSTIteratorclass. Therootof the BST is given as part of the constructor. The ...原创 2022-02-02 20:05:55 · 531 阅读 · 0 评论 -
LeetCode 449 Serialize and Deserialize BST (dfs 推荐)
Serialization is converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.Desi原创 2022-02-01 19:41:48 · 372 阅读 · 0 评论 -
LeetCode 687 Longest Univalue Path (dfs dp 推荐)
Given therootof a binary tree, returnthe length of the longest path, where each node in the path has the same value. This path may or may not pass through the root.The length of the pathbetween two nodes is represented by the number of edges between ...原创 2022-01-27 23:12:53 · 190 阅读 · 0 评论 -
LeetCode 429 N-ary Tree Level Order Traversal (bfs)
Given an n-ary tree, return thelevel ordertraversal of its nodes' values.Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).Example 1:Input: root = [1..原创 2022-01-27 21:27:22 · 279 阅读 · 0 评论 -
LeetCode 93 Restore IP Addresses (dfs)
Avalid IP addressconsists of exactly four integers separated by single dots. Each integer is between0and255(inclusive) and cannot have leading zeros.For example,"0.1.2.201"and"192.168.1.1"arevalidIP addresses, but"0.011.255.245","192.168.1....原创 2022-01-11 09:55:34 · 789 阅读 · 0 评论 -
LeetCode 1764 Form Array by Concatenating Subarrays of Another Array (dfs)
You are given a 2D integer arraygroupsof lengthn. You are also given an integer arraynums.You are asked if you can choosendisjointsubarrays from the arraynumssuch that theithsubarray is equal togroups[i](0-indexed), and ifi > 0, the(i-1...原创 2021-11-01 20:55:04 · 147 阅读 · 0 评论 -
LeetCode 1376 Time Needed to Inform All Employees (dfs)
A company hasnemployees with a unique ID for each employee from0ton - 1. The head of the company is the one withheadID.Each employee has one direct manager given in themanagerarray wheremanager[i]is the direct manager of thei-themployee,mana...原创 2021-10-10 14:46:30 · 173 阅读 · 0 评论 -
LeetCode 1284 Minimum Number of Flips to Convert Binary Matrix to Zero Matrix (bfs)
Given am x nbinary matrixmat. In one step, you can choose one cell and flip it and all the four neighbors of it if they exist (Flip is changing1to0and0to1). A pair of cells are called neighbors if they share one edge.Return theminimum number o...原创 2021-07-30 14:09:00 · 187 阅读 · 0 评论 -
LeetCode 1008 Construct Binary Search Tree from Preorder Traversal (dfs)
Given an array of integers preorder, which represents thepreorder traversalof a BST (i.e.,binary search tree), construct the tree and returnits root.It isguaranteedthat there is always possible to find a binary search tree with the given requiremen...原创 2021-07-14 13:53:08 · 102 阅读 · 0 评论