Leetcode Problem 2359. Find Closest Node to Given Two Nodes

2359. Find Closest Node to Given Two Nodes

Leetcode Solutions

Breadth First Search (BFS) Approach

  1. Initialize two arrays, dist1 and dist2, to store the distances from node1 and node2 to all other nodes, respectively, with large initial values.
  2. Perform BFS starting from node1 to fill dist1 with the shortest distances to all nodes.
  3. Perform BFS starting from node2 to fill dist2 with the shortest distances to all nodes.
  4. Initialize minDistNode to -1 and minDistTillNow to a large value.
  5. Iterate over all nodes to find the node that minimizes the maximum distance from both node1 and node2.
  6. Update minDistNode and minDistTillNow accordingly during the iteration.
  7. Return minDistNode as the result.
UML Thumbnail

Depth First Search (DFS) Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...