coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 08:51:42 +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/minimize-the-total-price-of-the-trips.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"8.5K\", \"totalSubmission\": \"19.3K\", \"totalAcceptedRaw\": 8525, \"totalSubmissionRaw\": 19318, \"acRate\": \"44.1%\"}",
"stats": "{\"totalAccepted\": \"8.5K\", \"totalSubmission\": \"19.3K\", \"totalAcceptedRaw\": 8533, \"totalSubmissionRaw\": 19329, \"acRate\": \"44.1%\"}",
"hints": [
"The final answer is the price[i] * freq[i], where freq[i] is the number of times node i was visited during the trip, and price[i] is the final price.",
"To find freq[i] we will use dfs or bfs for each trip and update every node on the path start and end.",