coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/find-closest-node-to-given-two-nodes.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"72.9K\", \"totalSubmission\": \"159.8K\", \"totalAcceptedRaw\": 72891, \"totalSubmissionRaw\": 159805, \"acRate\": \"45.6%\"}",
"stats": "{\"totalAccepted\": \"72.9K\", \"totalSubmission\": \"159.8K\", \"totalAcceptedRaw\": 72897, \"totalSubmissionRaw\": 159813, \"acRate\": \"45.6%\"}",
"hints": [
"How can you find the shortest distance from one node to all nodes in the graph?",
"Use BFS to find the shortest distance from both node1 and node2 to all nodes in the graph. Then iterate over all nodes, and find the node with the minimum max distance."