- java.lang.Object
-
- g2001_2100.s2078_two_furthest_houses_with_different_colors.Solution
-
public class Solution extends Object
2078 - Two Furthest Houses With Different Colors.
Easy
There are
nhouses evenly lined up on the street, and each house is beautifully painted. You are given a 0-indexed integer arraycolorsof lengthn, wherecolors[i]represents the color of theithhouse.Return the maximum distance between two houses with different colors.
The distance between the
ithandjthhouses isabs(i - j), whereabs(x)is the absolute value ofx.Example 1:
Input: colors = [1 ,1,1, 6 ,1,1,1]
Output: 3
Explanation: 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.
Example 2:
Input: colors = [1 ,8,3,8, 3 ]
Output: 4
Explanation: 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.
Example 3:
Input: colors = [0 ,**1** ]
Output: 1
Explanation: 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.
Constraints:
n == colors.length2 <= n <= 1000 <= colors[i] <= 100- Test data are generated such that at least two houses have different colors.
-
-
Constructor Summary
Constructors Constructor and Description Solution()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method and Description intmaxDistance(int[] colors)
-