mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
20 lines
736 B
HTML
20 lines
736 B
HTML
<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> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<pre><strong>Input:</strong> barcodes = [1,1,1,2,2,2]
|
|
<strong>Output:</strong> [2,1,2,1,2,1]
|
|
</pre><p><strong>Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> barcodes = [1,1,1,1,2,2,3,3]
|
|
<strong>Output:</strong> [1,3,1,3,1,2,1,2]
|
|
</pre>
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= barcodes.length <= 10000</code></li>
|
|
<li><code>1 <= barcodes[i] <= 10000</code></li>
|
|
</ul>
|