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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/minimum-weighted-subgraph-with-the-required-paths.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3K\", \"totalSubmission\": \"8.6K\", \"totalAcceptedRaw\": 3041, \"totalSubmissionRaw\": 8589, \"acRate\": \"35.4%\"}",
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"8.6K\", \"totalAcceptedRaw\": 3064, \"totalSubmissionRaw\": 8640, \"acRate\": \"35.5%\"}",
"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.",