mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 22:13:28 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "有 `N` 位扣友参加了微软与力扣举办了「以扣会友」线下活动。主办方提供了 `2*N` 道题目,整型数组 `questions` 中每个数字对应了每道题目所涉及的知识点类型。\r\n若每位扣友选择不同的一题,请返回被选的 `N` 道题目至少包含多少种知识点类型。\r\n\r\n\r\n**示例 1:**\r\n>输入:`questions = [2,1,6,2]`\r\n>\r\n>输出:`1`\r\n>\r\n>解释:有 2 位扣友在 4 道题目中选择 2 题。\r\n> 可选择完成知识点类型为 2 的题目时,此时仅一种知识点类型\r\n> 因此至少包含 1 种知识点类型。\r\n\r\n**示例 2:**\r\n>输入:`questions = [1,5,1,3,4,5,2,5,3,3,8,6]`\r\n>\r\n>输出:`2`\r\n>\r\n>解释:有 6 位扣友在 12 道题目中选择题目,需要选择 6 题。\r\n> 选择完成知识点类型为 3、5 的题目,因此至少包含 2 种知识点类型。\r\n\r\n\r\n\r\n**提示:**\r\n- `questions.length == 2*n`\r\n- `2 <= questions.length <= 10^5`\r\n- `1 <= questions[i] <= 1000`",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 7,
|
||||
"likes": 8,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -162,7 +162,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"8K\", \"totalAcceptedRaw\": 5276, \"totalSubmissionRaw\": 7987, \"acRate\": \"66.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"8.5K\", \"totalAcceptedRaw\": 5633, \"totalSubmissionRaw\": 8520, \"acRate\": \"66.1%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user