# 1217. Minimum Cost to Move Chips to The Same Position

We have `n` chips, where the position of the `ith` 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 `ith` chip from `position[i]` to:

• `position[i] + 2` or `position[i] - 2` with `cost = 0`.
• `position[i] + 1` or `position[i] - 1` with `cost = 1`.

Return  the minimum cost  needed to move all the 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
``````

Constraints:

• `1 <= position.length <= 100`
• `1 <= position[i] <= 10^9`

``````class Solution {
public:
int minCostToMoveChips(vector<int>& position) {
int res = INT_MAX;
unordered_map<int, int> posCnt;
for (int pos : position) ++posCnt[pos];
for (auto &a : posCnt) {
int sum = 0;
for (auto &b : posCnt) {
if ((b.first - a.first) % 2 == 0) continue;
sum += b.second;
}
res = min(res, sum);
}
return res;
}
};
``````

``````class Solution {
public:
int minCostToMoveChips(vector<int>& position) {
int even = 0, odd = 0;
for (int pos : position) {
(pos % 2 == 1) ? ++odd : ++even;
}
return min(odd, even);
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1217

Minimum Number of Operations to Move All Balls to Each Box

https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/

https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/discuss/398239/C%2B%2B-3-lines

https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/discuss/398178/Detailed-Explanation-O(n)-or-O(1)-Everything-is-in-0-or-1

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation