You are given an integer array nums. You need to create a 2D array from nums satisfying the following conditions:
- The 2D array should contain only the elements of the array nums.
- Each row in the 2D array contains distinct integers.
- The number of rows in the 2D array should be minimal.
Return the resulting array. If there are multiple answers, return any of them.
Note that the 2D array can have a different number of elements on each row.
Example 1:
Input: nums = [1,3,4,1,2,3,1]
Output: [[1,3,4,2],[1,3],[1]]
Explanation: 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.
Example 2:
Input: nums = [1,2,3,4]
Output: [[4,3,2,1]]
Explanation: All elements of the array are distinct, so we can keep all of them in the first row of the 2D array.
Constraints:
- 1 <= nums.length <= 200
- 1 <= nums[i] <= nums.length
class Solution:
def findMatrix(self, nums: List[int]) -> List[List[int]]:
c=Counter(nums)
cmax=0
for num in nums:
cmax=max(cmax, nums.count(num))
ans=[]
for i in range(cmax):
temp=[]
for k,v in c.items():
if v!=0:
temp.append(k)
c[k]-=1
ans.append(temp.copy())
return ans
'알고리즘 문제 > Leetcode' 카테고리의 다른 글
1282. Group the People Given the Group Size They Belong To (0) | 2023.04.11 |
---|---|
2545. Sort the Students by Their Kth Score (0) | 2023.04.11 |
807. Max Increase to Keep City Skyline (0) | 2023.04.11 |
1302. Deepest Leaves Sum (0) | 2023.04.11 |
1570. Dot Product of Two Sparse Vectors (0) | 2023.04.11 |