LeetCode-Solutions/Python/distant-barcodes.py at master · pythonpeixun/LeetCode-Solutions · GitHub

24 lines (20 loc) · 611 Bytes

# Time: O(klogk), k is the number of distinct barcodes

# Space: O(k)

import collections

class Solution(object):

def rearrangeBarcodes(self, barcodes):

"""

:type barcodes: List[int]

:rtype: List[int]

"""

cnts = collections.Counter(barcodes)

sorted_cnts = [[v, k] for k, v in cnts.iteritems()]

sorted_cnts.sort(reverse=True)

i = 0

for v, k in sorted_cnts:

for _ in xrange(v):

barcodes[i] = k

i += 2

if i >= len(barcodes):

i = 1

return barcodes

Expand file tree