1
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
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 63,
"dislikes": 15,
"likes": 70,
"dislikes": 20,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[1,1,1],[1,0,1],[0,0,1]]\n[[1,0,1,0],[1,0,0,0],[0,0,1,0],[1,1,1,0]]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 1143, \"totalSubmissionRaw\": 2472, \"acRate\": \"46.2%\"}",
"stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"3.1K\", \"totalAcceptedRaw\": 1457, \"totalSubmissionRaw\": 3083, \"acRate\": \"47.3%\"}",
"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).",