coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-09 17:31: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/minimum-cost-of-a-path-with-special-roads.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"10.1K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 10096, \"totalSubmissionRaw\": 27884, \"acRate\": \"36.2%\"}",
"stats": "{\"totalAccepted\": \"10.1K\", \"totalSubmission\": \"27.9K\", \"totalAcceptedRaw\": 10099, \"totalSubmissionRaw\": 27900, \"acRate\": \"36.2%\"}",
"hints": [
"It can be proven that it is optimal to go only to the positions that are either the start or the end of a special road or the target position.",
"Consider all positions given to you as nodes in a graph, and the edges of the graph are the special roads.",