mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
47 lines
2.4 KiB
HTML
47 lines
2.4 KiB
HTML
|
<p>There are <code>n</code> houses evenly lined up on the street, and each house is beautifully painted. You are given a <strong>0-indexed</strong> integer array <code>colors</code> of length <code>n</code>, where <code>colors[i]</code> represents the color of the <code>i<sup>th</sup></code> house.</p>
|
||
|
|
|
||
|
|
<p>Return <em>the <strong>maximum</strong> distance between <strong>two</strong> houses with <strong>different</strong> colors</em>.</p>
|
||
|
|
|
||
|
|
<p>The distance between the <code>i<sup>th</sup></code> and <code>j<sup>th</sup></code> houses is <code>abs(i - j)</code>, where <code>abs(x)</code> is the <strong>absolute value</strong> of <code>x</code>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/10/31/eg1.png" style="width: 610px; height: 84px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> colors = [<u><strong>1</strong></u>,1,1,<strong><u>6</u></strong>,1,1,1]
|
||
|
|
<strong>Output:</strong> 3
|
||
|
|
<strong>Explanation:</strong> In the above image, color 1 is blue, and color 6 is red.
|
||
|
|
The furthest two houses with different colors are house 0 and house 3.
|
||
|
|
House 0 has color 1, and house 3 has color 6. The distance between them is abs(0 - 3) = 3.
|
||
|
|
Note that houses 3 and 6 can also produce the optimal answer.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2021/10/31/eg2.png" style="width: 426px; height: 84px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> colors = [<u><strong>1</strong></u>,8,3,8,<u><strong>3</strong></u>]
|
||
|
|
<strong>Output:</strong> 4
|
||
|
|
<strong>Explanation:</strong> In the above image, color 1 is blue, color 8 is yellow, and color 3 is green.
|
||
|
|
The furthest two houses with different colors are house 0 and house 4.
|
||
|
|
House 0 has color 1, and house 4 has color 3. The distance between them is abs(0 - 4) = 4.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 3:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> colors = [<u><strong>0</strong></u>,<strong><u>1</u></strong>]
|
||
|
|
<strong>Output:</strong> 1
|
||
|
|
<strong>Explanation:</strong> The furthest two houses with different colors are house 0 and house 1.
|
||
|
|
House 0 has color 0, and house 1 has color 1. The distance between them is abs(0 - 1) = 1.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>n == colors.length</code></li>
|
||
|
|
<li><code>2 <= n <= 100</code></li>
|
||
|
|
<li><code>0 <= colors[i] <= 100</code></li>
|
||
|
|
<li>Test data are generated such that <strong>at least</strong> two houses have different colors.</li>
|
||
|
|
</ul>
|