leetcode 解题思路

You are given an arraypointsrepresenting integer coordinates of some points on a 2D-plane, wherepoints[i] = [xi, yi].The cost of connecting two points[xi, yi]and[xj, yj]is themanhattan distancebetween them:|xi- xj| + |yi- yj|, where|val|den...

There areNcities numbered from 1 toN.You are givenconnections, where eachconnections[i] = [city1, city2, cost]represents the cost to connectcity1andcity2together. (Aconnectionis bidirec...

You are given an undirected weighted graph ofnnodes (0-indexed), represented by an edge list whereedges[i] = [a, b]is an undirected edge connecting the nodesaandbwith a probability of success of traversing that edgesuccProb[i].Given two nodesst...

BFSLevel OrderTopological SortDijkstra

Given amxngrid. Each cell of thegridhas a sign pointing to the next cell you should visit if you are currently in this cell. The sign ofgrid[i][j]can be:1which means go to the cell to the right. (i.e go fromgrid[i][j]togrid[i][j + 1]) 2whic...

On an N x Ngrid, each squaregrid[i][j]represents the elevation at that point(i,j).Now rain starts to fall. At timet, the depth of the water everywhere ist. You can swim from a square to another 4-directionally adjacent square if and only if the ele...

You are given anm* nmatrix,mat, and an integerk,whichhas its rows sorted in non-decreasingorder.You are allowed to choose exactly 1 element from each row to form an array.Return the Kthsma...

Given amatrix of integersAwithRrows andCcolumns, findthemaximumscoreof a path starting at[0,0]and ending at[R-1,C-1].Thescoreof a path is theminimumvalue in that path. For example...

There arencities numbered from0ton-1. Given the arrayedgeswhereedges[i] = [fromi, toi, weighti]represents a bidirectional and weighted edge between citiesfromiandtoi, and given the integer...

Giventimes, a list of travel times asdirectededgestimes[i] = (u, v, w), whereuis the source node,vis the target node, andwis the time it takes for a signal to travel from source to target....

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

Example 1:Input: n = 3, edges = [[0,1,100],[1,2,100],[0,2,500]]src = 0, dst = 2, k = 1Output: 200Explanation: The graph looks like this:思路：就是要弄明白graph怎么建立，pq里面存什么，怎么进行搜索；graph: HashMap<...

Input 1: a maze represented by a 2D array0 0 1 0 00 0 0 0 00 0 0 1 01 1 0 1 10 0 0 0 0Input 2: start coordinate (rowStart, colStart) = (0, 4)Input 3: destination coordinate (rowDest, colDest...