Skip to content

Commit 9badb0b

Browse files
solves minimum cost to move chips to same position
1 parent 2cb5e68 commit 9badb0b

File tree

2 files changed

+11
-2
lines changed

2 files changed

+11
-2
lines changed

README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -318,8 +318,8 @@
318318
| 1196 | 🔒 [How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket) | | |
319319
| 1200 | [Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference) | [![Java](assets/java.png)](src/MinimumAbsoluteDifference.java) | |
320320
| 1207 | [Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences) | [![Java](assets/java.png)](src/UniqueNumberOfOccurrences.java) | |
321-
| 1213 | [Intersection of Three Sorted Arrays](https://leetcode.com/problems/intersection-of-three-sorted-arrays) | | |
322-
| 1217 | [Play With Chips](https://leetcode.com/problems/play-with-chips) | | |
321+
| 1213 | 🔒 [Intersection of Three Sorted Arrays](https://leetcode.com/problems/intersection-of-three-sorted-arrays) | | |
322+
| 1217 | [Minimum Cost to Move Chips to The Same Position](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position) | [![Java](assets/java.png)](src/MinimumCostToMoveChipsToTheSamePosition.java) | |
323323
| 1221 | [Split A String In Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings) | | |
324324
| 1228 | [Missing A Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression) | | |
325325
| 1232 | [Check If It Is A Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line) | | |
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
public class MinimumCostToMoveChipsToTheSamePosition {
2+
public int minCostToMoveChips(int[] positions) {
3+
int evenPositionChips = 0;
4+
for (int position : positions) {
5+
if (position % 2 == 0) evenPositionChips++;
6+
}
7+
return Math.min(evenPositionChips, positions.length - evenPositionChips);
8+
}
9+
}

0 commit comments

Comments
 (0)