coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/[no content]find-shortest-path-with-k-hops.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"588\", \"totalSubmission\": \"982\", \"totalAcceptedRaw\": 588, \"totalSubmissionRaw\": 982, \"acRate\": \"59.9%\"}",
"stats": "{\"totalAccepted\": \"589\", \"totalSubmission\": \"983\", \"totalAcceptedRaw\": 589, \"totalSubmissionRaw\": 983, \"acRate\": \"59.9%\"}",
"hints": [
"Let's construct a new graph and run Dijkstra on it to get the answer to the problem.",
"We define the new graph as follows: Each node of this graph is a pair (v, c) where v is a node from the given graph and c is any number between 0 and k (inclusive).",