dfs bfs
文章平均质量分 74
ForABiggerWorld
这个作者很懒,什么都没留下…
展开
-
1718. Construct the Lexicographically Largest Valid Sequence
Given an integern, find a sequence that satisfies all of the following:The integer1occurs once in the sequence. Each integer between2andnoccurs twice in the sequence. For every integeribetween2andn, thedistancebetween the two occurrences ...原创 2021-01-12 21:17:47 · 241 阅读 · 0 评论 -
1723. Find Minimum Time to Finish All Jobs
You are given an integer arrayjobs, wherejobs[i]is the amount of time it takes to complete theithjob.There arekworkers that you can assign jobs to. Each job should be assigned toexactlyone worker. Theworking timeof a worker is the sum of the t...原创 2021-01-10 20:29:43 · 299 阅读 · 0 评论 -
1278. Palindrome Partitioning III
You are given a stringscontaining lowercase letters and an integerk. You need to :First, change some characters ofsto other lowercase English letters. Then dividesintoknon-empty disjoint s...原创 2020-02-01 10:07:22 · 136 阅读 · 1 评论 -
1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
Given am x nbinary matrixmat. In one step, you can choose one cell and flip it and all the four neighbours of itif they exist (Flip is changing 1 to 0 and 0 to 1). A pair of cells are called neigh...原创 2020-01-31 18:36:07 · 211 阅读 · 0 评论 -
1286. Iterator for Combination
Design an Iterator class, which has:A constructor that takes a stringcharactersofsorted distinctlowercase English letters and a numbercombinationLengthas arguments. A functionnext()that ret...原创 2020-01-31 13:55:40 · 364 阅读 · 0 评论 -
1298. Maximum Candies You Can Get from Boxes
Givennboxes, each box is given in the format[status, candies, keys, containedBoxes]where:status[i]: an integer which is1ifbox[i]is open and0ifbox[i]is closed. candies[i]:an integer rep...原创 2020-01-31 11:14:40 · 198 阅读 · 0 评论 -
1319. Number of Operations to Make Network Connected
There arencomputers numbered from0ton-1connected byethernet cablesconnectionsforming a network whereconnections[i] = [a, b]represents a connection between computersaandb. Any computerca...原创 2020-01-30 23:00:44 · 335 阅读 · 0 评论 -
1307. Verbal Arithmetic Puzzle
Given an equation, represented bywordson left side and theresulton right side.You need to check if the equation is solvableunder the following rules:Each character is decoded as one digit (0 ...原创 2020-01-30 22:37:12 · 422 阅读 · 0 评论 -
1240. Tiling a Rectangle with the Fewest Squares
Given a rectangle of sizenxm, find the minimum number of integer-sided squares that tile the rectangle.Example 1:Input: n = 2, m = 3Output: 3Explanation: 3 squares are necessary to cove...原创 2019-11-02 22:32:31 · 287 阅读 · 0 评论 -
968. Binary Tree Cameras
Given a binary tree, we install cameras on the nodes of the tree. Each camera at a node can monitor its parent, itself, and its immediate children.Calculate the minimum number of cameras needed to...原创 2018-12-30 13:01:33 · 761 阅读 · 0 评论 -
980. Unique Paths III
On a 2-dimensional grid, there are 4 types of squares:1 represents the starting square. There is exactly one starting square. 2 represents the ending square. There is exactly one ending square. ...原创 2019-01-20 12:00:22 · 316 阅读 · 0 评论 -
996. Number of Squareful Arrays
Given an array A of non-negative integers, the array is squareful if for every pair of adjacent elements, their sum is a perfect square.Return the number of permutations of A that are squareful. Tw...原创 2019-02-17 21:00:19 · 199 阅读 · 0 评论 -
5084. Insufficient Nodes in Root to Leaf Paths
Given therootof a binary tree, consider allroot to leaf paths: paths from the rootto any leaf. (A leaf is a node with no children.)Anodeisinsufficientifeverysuch root to leaf path interse...原创 2019-06-09 14:08:36 · 450 阅读 · 0 评论 -
964. Least Operators to Express Number
Given a single positive integer x, we will write an expression of the form x (op1) x (op2) x (op3) x ... where each operator op1, op2, etc. is either addition, subtraction, multiplication, or division...原创 2018-12-23 13:07:34 · 700 阅读 · 0 评论 -
958. Check Completeness of a Binary Tree
Given a binary tree, determine if it is a complete binary tree.Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possibly the last, is completely fil...原创 2018-12-16 12:00:05 · 204 阅读 · 0 评论 -
952. Largest Component Size by Common Factor
Given a non-empty array of unique positive integers A, consider the following graph:There are A.length nodes, labelled A[0] to A[A.length - 1]; There is an edge between A[i] and A[j] if and only if...原创 2018-12-02 12:56:01 · 409 阅读 · 0 评论 -
947. Most Stones Removed with Same Row or Column
On a 2D plane, we place stones at some integer coordinate points. Each coordinate point may have at most one stone.Now, a move consists of removing a stone that shares a column or row with another ...原创 2018-11-25 12:38:18 · 423 阅读 · 0 评论 -
934. Shortest Bridge
In a given 2D binary array A, there are two islands. (An island is a 4-directionally connected group of 1s not connected to any other 1s.)Now, we may change 0s to 1s so as to connect the two island...原创 2018-11-04 11:01:12 · 373 阅读 · 0 评论 -
928. Minimize Malware Spread II
(This problem is the same as Minimize Malware Spread, with the differences bolded.)In a network of nodes, each node i is directly connected to another node j if and only if graph[i][j] = 1.Some no...原创 2018-10-21 11:23:54 · 476 阅读 · 0 评论 -
924. Minimize Malware Spread
In a network of nodes, each node i is directly connected to another node j if and only if graph[i][j] = 1.Some nodes initial are initially infected by malware. Whenever two nodes are directly conne...原创 2018-10-14 11:10:11 · 412 阅读 · 0 评论 -
1015. Numbers With 1 Repeated Digit
Given a positive integerN, return the number of positive integers less than or equal toNthat have at least 1 repeated digit.Example 1:Input: 20Output: 1Explanation: The only positive numb...原创 2019-03-17 12:09:17 · 235 阅读 · 0 评论 -
1028. Recover a Tree From Preorder Traversal
We run apreorderdepth first search on therootof a binary tree.At each node in this traversal, we outputDdashes (whereDis thedepthof this node), then we output the value of this node.(If ...原创 2019-04-14 20:17:48 · 344 阅读 · 0 评论 -
778. Swim in Rising Water
On an N x N grid, each square grid[i][j] represents the elevation at that point (i,j).Now rain starts to fall. At time t, the depth of the water everywhere is t. You can swim from a square to原创 2018-02-04 17:50:34 · 479 阅读 · 0 评论 -
1219. Path with Maximum Gold
In a gold minegridof sizem * n,each cell in this mine has an integer representing the amount of goldin that cell,0if it is empty.Return the maximum amount of gold youcan collect under the...原创 2019-10-07 16:13:40 · 319 阅读 · 0 评论 -
1210. Minimum Moves to Reach Target with Rotations
In ann*ngrid, there is a snake that spans 2 cells and starts moving from the top left corner at(0, 0)and(0, 1). The grid has empty cells represented by zeros and blocked cells represented by ones...原创 2019-10-07 16:12:24 · 315 阅读 · 0 评论 -
1192. Critical Connections in a Network
There arenservers numbered from0ton-1connected byundirected server-to-serverconnectionsforming a network whereconnections[i] = [a, b]represents a connection between serversaandb. Any ser...原创 2019-09-15 15:06:45 · 1719 阅读 · 0 评论 -
5069. Last Substring in Lexicographical Order
Given a strings, return the last substring ofsin lexicographical order.Example 1:Input: "abab"Output: "bab"Explanation: The substrings are ["a", "ab", "aba", "abab", "b", "ba", "bab"]. Th...原创 2019-08-18 12:22:10 · 367 阅读 · 0 评论 -
5053. As Far from Land as Possible
Given an N x Ngridcontaining only values0and1, where0represents waterand1represents land, find a water cell such that its distance to the nearest land cell is maximized and return the distan...原创 2019-08-18 12:22:08 · 514 阅读 · 0 评论 -
5132. Shortest Path with Alternating Colors
Consider a directed graph, with nodes labelled0, 1, ..., n-1. In this graph, each edge is either red or blue, and there couldbe self-edges or parallel edges.Each[i, j]inred_edgesdenotes a red...原创 2019-07-21 12:01:06 · 343 阅读 · 0 评论 -
1091. Shortest Path in Binary Matrix
In an N by N square grid, each cell is either empty (0) or blocked (1).Aclearpath from top-left to bottom-righthas lengthkif and only if it is composed of cellsC_1, C_2, ..., C_ksuch that:A...原创 2019-06-16 13:24:37 · 284 阅读 · 0 评论 -
5087. Letter Tile Possibilities
You have a set oftiles, where each tile has one lettertiles[i]printed on it. Return the number of possible non-empty sequences of letters you can make.Example 1:Input: "AAB"Output: 8Expl...原创 2019-06-09 14:04:05 · 522 阅读 · 0 评论 -
1036. Escape a Large Maze
In a 1 million by 1 million grid, the coordinates of each grid square are(x, y)with0 <= x, y < 10^6.We start at thesourcesquare and want to reach thetargetsquare. Each move, we can wal...原创 2019-04-28 13:24:44 · 590 阅读 · 0 评论 -
913. Cat and Mouse
A game on an undirected graph is played by two players, Mouse and Cat, who alternate turns.The graph is given as follows: graph[a] is a list of all nodes b such that ab is an edge of the graph.Mou...原创 2018-10-03 10:25:47 · 817 阅读 · 0 评论 -
909. Snakes and Ladders
On an N x N board, the numbers from 1 to N*N are written boustrophedonically starting from the bottom left of the board, and alternating direction each row. For example, for a 6 x 6 board, the number...原创 2018-09-23 11:30:59 · 710 阅读 · 0 评论 -
589. N-ary Tree Preorder Traversal & 590. N-ary Tree Postorder 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,4].Note: Recursive solution is trivial, ...原创 2018-09-03 19:39:55 · 130 阅读 · 0 评论 -
440. K-th Smallest in Lexicographical Order
Given integers n and k, find the lexicographically k-th smallest integer in the range from 1 to n.Note: 1 ≤ k ≤ n ≤ 109.Example:Input:n: 13 k: 2Output:10Explanation:The lexicographical order ...原创 2018-04-09 16:05:12 · 136 阅读 · 0 评论 -
815. Bus Routes
We have a list of bus routes. Each routes[i] is a bus route that the i-th bus repeats forever. For example if routes[0] = [1, 5, 7], this means that the first bus (0-th indexed) travels in the sequenc...原创 2018-04-08 12:07:55 · 689 阅读 · 0 评论 -
805. Split Array With Same Average
In a given integer array A, we must move every element of A to either list B or list C. (B and C initially start empty.)Return true if and only if after such a move, it is possible that the average va...原创 2018-03-25 14:44:50 · 952 阅读 · 0 评论 -
803. Bricks Falling When Hit
We have a grid of 1s and 0s; the 1s in a cell represent bricks. A brick will not drop if and only if it is directly connected to the top of the grid, or at least one of its (4-way) adjacent bricks wi...原创 2018-03-23 14:55:03 · 411 阅读 · 0 评论 -
802. Find Eventual Safe States
In a directed graph, we start at some node and every turn, walk along a directed edge of the graph. If we reach a node that is terminal (that is, it has no outgoing directed edges), we stop.Now, say ...原创 2018-03-18 11:57:25 · 696 阅读 · 0 评论