在一个仓库里,有一排条形码,其中第 i 个条形码为 barcodes[i]。
请你重新排列这些条形码,使其中两个相邻的条形码 不能 相等。 你可以返回任何满足该要求的答案,此题保证存在答案。
示例 1:
输入:[1,1,1,2,2,2]
输出:[2,1,2,1,2,1]
示例 2:
输入:[1,1,1,1,2,2,3,3]
输出:[1,3,1,3,2,1,2,1]
提示:
1 <= barcodes.length <= 10000
1 <= barcodes[i] <= 10000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/distant-barcodes
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
JavaScript Code
/** * @param {number[]} barcodes * @return {number[]} */ var rearrangeBarcodes = function (barcodes) { const map = {}; for (let i = 0; i < barcodes.length; i++) { const barcode = barcodes[i]; map[barcode] = (map[barcode] || 0) + 1; } const list = Object.keys(map).map(b => [Number(b), map[b]]); list.sort((a, b) => a[1] - b[1]) const res = Array(barcodes.length); let i = 0; while (list.length) { let [barcode, count] = list.pop(); while (count-- > 0) { if (i >= barcodes.length) i = 1; res[i] = barcode; i += 2; } } return res; };
JavaScript Code
/** * @param {number[]} barcodes * @return {number[]} */ var rearrangeBarcodes = function (barcodes) { const map = {}; for (let i = 0; i < barcodes.length; i++) { const barcode = barcodes[i]; map[barcode] = (map[barcode] || 0) + 1; } // 堆的数据结构 [barcode, count] const list = Object.keys(map).map(b => [Number(b), map[b]]); const heap = new MaxHeap(list, function comparator(inserted, compared) { return inserted[1] < compared[1]; }); const res = Array(barcodes.length); let i = 0; while (heap.size() > 0) { let [barcode, count] = heap.pop(); while (count-- > 0) { if (i >= barcodes.length) i = 1; res[i] = barcode; i += 2; } } return res; }; // ************************************************** class Heap { constructor(list = [], comparator) { this.list = list; this.comparator = comparator; this.init(); } init() { const size = this.size(); for (let i = Math.floor(size / 2) - 1; i >= 0; i--) { this.heapify(this.list, size, i); } } insert(n) { this.list.push(n); const size = this.size(); for (let i = Math.floor(size / 2) - 1; i >= 0; i--) { this.heapify(this.list, size, i); } } peek() { return this.list[0]; } pop() { const last = this.list.pop(); if (this.size() === 0) return last; const returnItem = this.list[0]; this.list[0] = last; this.heapify(this.list, this.size(), 0); return returnItem; } size() { return this.list.length; } } class MaxHeap extends Heap { constructor(list, comparator) { super(list, comparator); } heapify(arr, size, i) { let largest = i; const left = Math.floor(i * 2 + 1); const right = Math.floor(i * 2 + 2); if (left < size && this.comparator(arr[largest], arr[left])) largest = left; if (right < size && this.comparator(arr[largest], arr[right])) largest = right; if (largest !== i) { [arr[largest], arr[i]] = [arr[i], arr[largest]]; this.heapify(arr, size, largest); } } }
JavaScript Code
/** * @param {number[]} barcodes * @return {number[]} */ var rearrangeBarcodes = function (barcodes) { const map = {}; for (let i = 0; i < barcodes.length; i++) { const barcode = barcodes[i]; map[barcode] = (map[barcode] || 0) + 1; } // 堆的数据结构 [barcode, count] const list = Object.keys(map).map(b => [Number(b), map[b]]); const heap = new MaxHeap(list, function comparator(inserted, compared) { return inserted[1] < compared[1]; }); const res = []; while (heap.size() > 1) { let [b1, cnt1] = heap.pop(); let [b2, cnt2] = heap.pop(); res.push(b1, b2) if (--cnt1 > 0) heap.insert([b1, cnt1]) if (--cnt2 > 0) heap.insert([b2, cnt2]) } if (heap.size()) { res.push(heap.pop()[0]); } return res };