coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 21:16:45 +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-cost-to-connect-two-groups-of-points.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"4.6K\", \"totalAcceptedRaw\": 2220, \"totalSubmissionRaw\": 4573, \"acRate\": \"48.5%\"}",
"stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"4.6K\", \"totalAcceptedRaw\": 2224, \"totalSubmissionRaw\": 4577, \"acRate\": \"48.6%\"}",
"hints": [
"Each point on the left would either be connected to exactly point already connected to some left node, or a subset of the nodes on the right which are not connected to any node",
"Use dynamic programming with bitmasking, where the state will be (number of points assigned in first group, bitmask of points assigned in second group)."