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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/[no content]maximum-number-of-accepted-invitations.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 62,
"likes": 63,
"dislikes": 15,
"isLiked": null,
"similarQuestions": "[]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"2.3K\", \"totalAcceptedRaw\": 1071, \"totalSubmissionRaw\": 2307, \"acRate\": \"46.4%\"}",
"stats": "{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 1143, \"totalSubmissionRaw\": 2472, \"acRate\": \"46.2%\"}",
"hints": [
"We can see that the problem can be represented as a directed graph with an edge from each boy to the girl he invited.",
"We need to choose a set of edges such that no to source points in the graph (i.e., boys) have an edge with the same endpoint (i.e., the same girl).",