mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
41 lines
1.5 KiB
HTML
41 lines
1.5 KiB
HTML
<p>You are given an integer array <code>nums</code>. You need to create a 2D array from <code>nums</code> satisfying the following conditions:</p>
|
|
|
|
<ul>
|
|
<li>The 2D array should contain <strong>only</strong> the elements of the array <code>nums</code>.</li>
|
|
<li>Each row in the 2D array contains <strong>distinct</strong> integers.</li>
|
|
<li>The number of rows in the 2D array should be <strong>minimal</strong>.</li>
|
|
</ul>
|
|
|
|
<p>Return <em>the resulting array</em>. If there are multiple answers, return any of them.</p>
|
|
|
|
<p><strong>Note</strong> that the 2D array can have a different number of elements on each row.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,3,4,1,2,3,1]
|
|
<strong>Output:</strong> [[1,3,4,2],[1,3],[1]]
|
|
<strong>Explanation:</strong> We can create a 2D array that contains the following rows:
|
|
- 1,3,4,2
|
|
- 1,3
|
|
- 1
|
|
All elements of nums were used, and each row of the 2D array contains distinct integers, so it is a valid answer.
|
|
It can be shown that we cannot have less than 3 rows in a valid array.</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,2,3,4]
|
|
<strong>Output:</strong> [[4,3,2,1]]
|
|
<strong>Explanation:</strong> All elements of the array are distinct, so we can keep all of them in the first row of the 2D array.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 200</code></li>
|
|
<li><code>1 <= nums[i] <= nums.length</code></li>
|
|
</ul>
|