#1217
Minimum Cost to Move Chips to The Same Position
newbie · 265 · lc easy +19 · verified · 72.8% accepted · 2,455 likes · top 82%
Description
You have n chips placed at various positions. The position of chip i is position[i]. All chips must be gathered at the same location.
In one step you can move any chip:
- Two positions in either direction at zero cost.
- One position in either direction at a cost of 1.
Return the minimum total cost to bring all chips to the same position.
Example 1:
Input: position = [1,2,3]
Output: 1
Explanation: First step: Move the chip at position 3 to position 1 with cost = 0.
Second step: Move the chip at position 2 to position 1 with cost = 1.
Total cost is 1.
Example 2:
Input: position = [2,2,2,3,3]
Output: 2
Explanation: We can move the two chips at position 3 to position 2. Each move has cost = 1. The total cost = 2.
Example 3:
Input: position = [1,1000000000]
Output: 1
Code
1
2
3