coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/minimum-cost-to-connect-two-groups-of-points.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 317,
"dislikes": 11,
"likes": 324,
"dislikes": 12,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[15,96],[36,2]]\n[[1,3,5],[4,1,1],[1,5,3]]\n[[2,5,1],[3,4,7],[8,1,2],[6,2,4],[3,8,8]]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"13.4K\", \"totalAcceptedRaw\": 6157, \"totalSubmissionRaw\": 13423, \"acRate\": \"45.9%\"}",
"stats": "{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"13.6K\", \"totalAcceptedRaw\": 6225, \"totalSubmissionRaw\": 13573, \"acRate\": \"45.9%\"}",
"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)."