1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +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": "<p>给你一个下标从 <strong>0</strong>&nbsp;开始的一维整数数组&nbsp;<code>original</code>&nbsp;和两个整数&nbsp;<code>m</code>&nbsp;和&nbsp;&nbsp;<code>n</code>&nbsp;。你需要使用&nbsp;<code>original</code>&nbsp;中&nbsp;<strong>所有</strong>&nbsp;元素创建一个&nbsp;<code>m</code>&nbsp;行&nbsp;<code>n</code>&nbsp;列的二维数组。</p>\n\n<p><code>original</code>&nbsp;中下标从 <code>0</code>&nbsp;到 <code>n - 1</code>&nbsp;(都 <strong>包含</strong> )的元素构成二维数组的第一行,下标从 <code>n</code>&nbsp;到 <code>2 * n - 1</code>&nbsp;(都 <strong>包含</strong>&nbsp;)的元素构成二维数组的第二行,依此类推。</p>\n\n<p>请你根据上述过程返回一个<em>&nbsp;</em><code>m x n</code>&nbsp;的二维数组。如果无法构成这样的二维数组,请你返回一个空的二维数组。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n<img src=\"https://assets.leetcode.com/uploads/2021/08/26/image-20210826114243-1.png\" style=\"width: 500px; height: 174px;\">\n<pre><b>输入:</b>original = [1,2,3,4], m = 2, n = 2\n<b>输出:</b>[[1,2],[3,4]]\n<strong>解释:\n</strong>构造出的二维数组应该包含 2 行 2 列。\noriginal 中第一个 n=2 的部分为 [1,2] ,构成二维数组的第一行。\noriginal 中第二个 n=2 的部分为 [3,4] ,构成二维数组的第二行。\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre><b>输入:</b>original = [1,2,3], m = 1, n = 3\n<b>输出:</b>[[1,2,3]]\n<b>解释:</b>\n构造出的二维数组应该包含 1 行 3 列。\n将 original 中所有三个元素放入第一行中,构成要求的二维数组。\n</pre>\n\n<p><strong>示例 3</strong></p>\n\n<pre><b>输入:</b>original = [1,2], m = 1, n = 1\n<b>输出:</b>[]\n<strong>解释:\n</strong>original 中有 2 个元素。\n无法将 2 个元素放入到一个 1x1 的二维数组中,所以返回一个空的二维数组。\n</pre>\n\n<p><strong>示例 4</strong></p>\n\n<pre><b>输入:</b>original = [3], m = 1, n = 2\n<b>输出:</b>[]\n<strong>解释:</strong>\noriginal 中只有 1 个元素。\n无法将 1 个元素放满一个 1x2 的二维数组,所以返回一个空的二维数组。\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= original.length &lt;= 5 * 10<sup>4</sup></code></li>\n\t<li><code>1 &lt;= original[i] &lt;= 10<sup>5</sup></code></li>\n\t<li><code>1 &lt;= m, n &lt;= 4 * 10<sup>4</sup></code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 120,
"likes": 121,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"35K\", \"totalSubmission\": \"52.4K\", \"totalAcceptedRaw\": 35001, \"totalSubmissionRaw\": 52356, \"acRate\": \"66.9%\"}",
"stats": "{\"totalAccepted\": \"35.7K\", \"totalSubmission\": \"53.5K\", \"totalAcceptedRaw\": 35704, \"totalSubmissionRaw\": 53492, \"acRate\": \"66.7%\"}",
"hints": [
"When is it possible to convert original into a 2D array and when is it impossible?",
"It is possible if and only if m * n == original.length",