Class Solution
java.lang.Object
g1001_1100.s1054_distant_barcodes.Solution
1054 - Distant Barcodes.<p>Medium</p>
<p>In a warehouse, there is a row of barcodes, where the <code>i<sup>th</sup></code> barcode is <code>barcodes[i]</code>.</p>
<p>Rearrange the barcodes so that no two adjacent barcodes are equal. You may return any answer, and it is guaranteed an answer exists.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> barcodes = [1,1,1,2,2,2]</p>
<p><strong>Output:</strong> [2,1,2,1,2,1]</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> barcodes = [1,1,1,1,2,2,3,3]</p>
<p><strong>Output:</strong> [1,3,1,3,1,2,1,2]</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= barcodes.length <= 10000</code></li>
<li><code>1 <= barcodes[i] <= 10000</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
rearrangeBarcodes
public int[] rearrangeBarcodes(int[] barcodes)
-