1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-25 23:08:57 +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 * n` 的网格。绘画规则为,小扣可以选择任意多行以及任意多列的格子涂成黑色(选择的整行、整列均需涂成黑色),所选行数、列数均可为 0。\n\n小扣希望最终的成品上需要有 `k` 个黑色格子,请返回小扣共有多少种涂色方案。\n\n注意两个方案中任意一个相同位置的格子颜色不同就视为不同的方案。\n\n**示例 1**\n>输入:`n = 2, k = 2`\n>\n>输出:`4`\n> \n>解释:一共有四种不同的方案:\n>第一种方案:涂第一列;\n>第二种方案:涂第二列;\n>第三种方案:涂第一行;\n>第四种方案:涂第二行。\n\n**示例 2**\n>输入:`n = 2, k = 1`\n> \n>输出:`0`\n> \n>解释:不可行,因为第一次涂色至少会涂两个黑格。\n\n**示例 3**\n>输入:`n = 2, k = 4`\n> \n>输出:`1`\n>\n>解释:共有 2*2=4 个格子,仅有一种涂色方案。\n\n**限制:**\n- `1 <= n <= 6`\n- `0 <= k <= n * n`\n\n\n",
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 62,
"likes": 63,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -144,7 +144,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"28.5K\", \"totalAcceptedRaw\": 9670, \"totalSubmissionRaw\": 28472, \"acRate\": \"34.0%\"}",
"stats": "{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"28.9K\", \"totalAcceptedRaw\": 9832, \"totalSubmissionRaw\": 28870, \"acRate\": \"34.1%\"}",
"hints": [],
"solution": null,
"status": null,