Play with Chips
给一个数组, 移动奇数位的数要花费1, 偶数花费1, 问最少花费让数都移动到一起.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 |
class Solution { public int minCostToMoveChips(int[] chips) { int even = 0; int odd = 0; for(int i = 0; i < chips.length; i++) { if(chips[i] % 2 != 0) odd++; else even++; } return Math.min(odd, even); } } |