mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 00:11:41 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>你有一块棋盘,棋盘上有一些格子已经坏掉了。你还有无穷块大小为<code>1 * 2</code>的多米诺骨牌,你想把这些骨牌<strong>不重叠</strong>地覆盖在<strong>完好</strong>的格子上,请找出你最多能在棋盘上放多少块骨牌?这些骨牌可以横着或者竖着放。</p>\n\n<p> </p>\n\n<p>输入:<code>n, m</code>代表棋盘的大小;<code>broken</code>是一个<code>b * 2</code>的二维数组,其中每个元素代表棋盘上每一个坏掉的格子的位置。</p>\n\n<p>输出:一个整数,代表最多能在棋盘上放的骨牌数。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre><strong>输入:</strong>n = 2, m = 3, broken = [[1, 0], [1, 1]]\n<strong>输出:</strong>2\n<strong>解释:</strong>我们最多可以放两块骨牌:[[0, 0], [0, 1]]以及[[0, 2], [1, 2]]。(见下图)</pre>\n\n<p><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/09/09/domino_example_1.jpg\" style=\"height: 204px; width: 304px;\"></p>\n\n<p> </p>\n\n<p><strong>示例 2:</strong></p>\n\n<pre><strong>输入:</strong>n = 3, m = 3, broken = []\n<strong>输出:</strong>4\n<strong>解释:</strong>下图是其中一种可行的摆放方式\n</pre>\n\n<p><img alt=\"\" src=\"https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2019/09/09/domino_example_2.jpg\" style=\"height: 304px; width: 304px;\"></p>\n\n<p> </p>\n\n<p><strong>限制:</strong></p>\n\n<ol>\n\t<li><code>1 <= n <= 8</code></li>\n\t<li><code>1 <= m <= 8</code></li>\n\t<li><code>0 <= b <= n * m</code></li>\n</ol>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 55,
|
||||
"likes": 56,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -126,7 +126,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"7.9K\", \"totalAcceptedRaw\": 3138, \"totalSubmissionRaw\": 7932, \"acRate\": \"39.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"8.2K\", \"totalAcceptedRaw\": 3258, \"totalSubmissionRaw\": 8150, \"acRate\": \"40.0%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user