Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file not shown.
26 changes: 26 additions & 0 deletions Convert An Array/solution.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
class Solution {
public List<List<Integer>> findMatrix(int[] nums) {
Map<Integer, Integer> freq = new HashMap<>();
int maxFreq = 0;

for (int num : nums) {
freq.put(num, freq.getOrDefault(num, 0) + 1);
maxFreq = Math.max(maxFreq, freq.get(num));
}

List<List<Integer>> res = new ArrayList<>();
for (int i = 0; i < maxFreq; i++) {
res.add(new ArrayList<>());
}

Map<Integer, Integer> position = new HashMap<>();

for (int num : nums) {
int row = position.getOrDefault(num, 0);
res.get(row).add(num);
position.put(num, row + 1);
}

return res;
}
}
27 changes: 27 additions & 0 deletions Convert An Array/solution.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
class Solution:
def findMatrix(self, nums: list[int]) -> list[list[int]]:
aux = {}
mayor = 0
for i in nums:
if i in aux:
aux[i] +=1
else:
aux[i]=1

for i in aux.values():
if i>mayor:
mayor = i

res = [[] for i in range(mayor)]
for i in nums:
idx = 0
while True:
if i not in res[idx]:
res[idx].append(i)
break
else:
idx+=1
return res

x = Solution()
print(x.findMatrix([1,3,4,1,2,3,1]))
24 changes: 24 additions & 0 deletions Convert An Array/solution.ts
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
function findMatrix(nums: number[]): number[][] {
const freq: { [key: number]: number } = {};
let maxFreq = 0;

for (const num of nums) {
freq[num] = (freq[num] || 0) + 1;
if (freq[num] > maxFreq) {
maxFreq = freq[num];
}
}

const res: number[][] = [];
for (let i = 0; i < maxFreq; i++) {
res.push([]);
}
const position: { [key: number]: number } = {};
for (const num of nums) {
const row = position[num] ?? 0;
res[row].push(num);
position[num] = row + 1;
}

return res;
}