_1217.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1217 {
publicstaticclassSolution1 {
/*
 * credit: https://leetcode.com/problems/play-with-chips/discuss/398239/C%2B%2B-3-lines
 */
publicintminCostToMoveChips(int[] position) {
intchipsAtOddPosition = 0;
intchipsAtEvenPosition = 0;
for (inti = 0; i < position.length; i++) {
if (position[i] % 2 == 0) {
chipsAtEvenPosition++;
 } else {
chipsAtOddPosition++;
 }
 }
returnchipsAtEvenPosition > chipsAtOddPosition
 ? chipsAtOddPosition
 : chipsAtEvenPosition;
 }
 }
}