Minimum Cost to Move Chips to The Same Position
We have n chips, where the position of the i^th chip is position[i].
We need to move all the chips to the same position. In one step, we can change the position of the i^th chip from position[i] to:
position[i] + 2orposition[i] - 2withcost = 0.position[i] + 1orposition[i] - 1withcost = 1.
Return the minimum cost needed to move all the chips to the same position.
Example 1
Input
position = [1,2,3]Output
1Move the chip at position 3 to position 1 with cost 0, then move the chip at position 2 to position 1 with cost 1, for a total cost of 1.
Example 2
Input
position = [2,2,2,3,3]Output
2Move the two chips at position 3 to position 2, each with cost 1, for a total cost of 2.
Constraints
- 1 <= position.length <= 100
- 1 <= position[i] <= 10^9