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

@@ -12,7 +12,7 @@
"translatedContent": "麻将的游戏规则中,共有两种方式凑成「一组牌」:\n- 顺子:三张牌面数字连续的麻将,例如 [4,5,6]\n- 刻子:三张牌面数字相同的麻将,例如 [10,10,10]\n\n给定若干数字作为麻将牌的数值记作一维数组 `tiles`),请返回所给 `tiles` 最多可组成的牌组数。\n\n注意凑成牌组时每张牌仅能使用一次。\n\n**示例 1**\n>输入:`tiles = [2,2,2,3,4]`\n>\n>输出:`1`\n>\n>解释:最多可以组合出 [2,2,2] 或者 [2,3,4] 其中一组牌。\n\n**示例 2**\n>输入:`tiles = [2,2,2,3,4,1,3]`\n>\n>输出:`2`\n>\n>解释:最多可以组合出 [1,2,3] 与 [2,3,4] 两组牌。\n\n**提示:**\n- `1 <= tiles.length <= 10^5`\n- `1 <= tiles[i] <= 10^9`",
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 18,
"likes": 23,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"3.6K\", \"totalAcceptedRaw\": 1104, \"totalSubmissionRaw\": 3593, \"acRate\": \"30.7%\"}",
"stats": "{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"3.8K\", \"totalAcceptedRaw\": 1245, \"totalSubmissionRaw\": 3840, \"acRate\": \"32.4%\"}",
"hints": [],
"solution": null,
"status": null,