MCPcopy Create free account
hub / github.com/BeeBombshell/Python-DSA / sortArray

Method sortArray

Sort-all/counting.py:2–5  ·  view source on GitHub ↗
(self, N: List[int])

Source from the content-addressed store, hash-verified

1class Solution:
2 def sortArray(self, N: List[int]) -> List[int]:
3 C, m, M, S = collections.Counter(N), min(N), max(N), []
4 for n in range(m,M+1): S.extend([n]*C[n])
5 return S
6

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected