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/minimum-weighted-subgraph-with-the-required-paths.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 10705, \"totalSubmissionRaw\": 29430, \"acRate\": \"36.4%\"}",
"stats": "{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 10707, \"totalSubmissionRaw\": 29434, \"acRate\": \"36.4%\"}",
"hints": [
"Consider what the paths from src1 to dest and src2 to dest would look like in the optimal solution.",
"It can be shown that in an optimal solution, the two paths from src1 and src2 will coincide at one node, and the remaining part to dest will be the same for both paths. Now consider how to find the node where the paths will coincide.",