leetcode 解题思路

You are given a0-indexed2D integer arraypairswherepairs[i] = [starti, endi]. An arrangement ofpairsisvalidif for every indexiwhere1 <= i < pairs.length, we haveendi-1== starti.Returnanyvalid arrangement ofpairs.Note:The inputs w...

In a given 2D binary arrayA, there are two islands. (An island is a 4-directionally connected group of1s not connected to any other 1s.)Now, we may change0s to1s so as to connect the two islands together to form 1 island.Return the smallest number...

Equations are given in the formatA / B = k, whereAandBare variables represented as strings, andkis a real number (floating point number). Given some queries, return the answers. If the answer does not exist, return-1.0.Example:Givena / b = 2.0,...

Given an undirected tree, returnits diameter: the number ofedgesin a longest path in that tree.The tree is given as an arrayofedgeswhereedges[i] = [u, v]is a bidirectional edge between nodesuandv. Each node haslabels in the set{0, 1, ..., e...

Given an undirected tree consisting ofnvertices numbered from 0 ton-1, which has some apples in theirvertices. You spend 1 second to walk over oneedge of the tree.Return the minimum time in secondsyou have to spendin order to collect all apples in ...

There arenservers numbered from0ton-1connected byundirected server-to-serverconnectionsforming a network whereconnections[i] = [a, b]represents a connection between serversaandb. Any ser...

Given an undirectedgraph, returntrueif and only if it is bipartite.Recall that a graph isbipartiteif we can split it's set of nodes into two independentsubsets A and B such that every edge in ...

Input:root = [1,2,3,4,null,null,null,5,null,6], k = 2Diagram of binary tree: 1 / \ 2 3 / 4 / 5 / 6Output: 3Expl...

There are a total ofncourses you have to take, labeled from0ton - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a...

1.如何建立图2. BFS3. DFS

There are a total ofncourses you have to take, labeled from0ton - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a...

Given a list of airline tickets represented by pairs of departure and arrival airports[from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs fromJFK. Thus, the ...

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for each nod...