Minimum Cost to Move Chips to The Same Position LeetCode solution in Java

1
class Solution {
2
  public int minCostToMoveChips(int[] position) {
3
    int even = 0;
4
    int odd = 0;
5
    for (int i = 0; i < position.length; i++) {
6
      if (position[i] % 2 == 0) {
7
        even++;
8
      } else {
9
        odd++;
10
      }
11
    }
12
    return Math.min(even, odd);
13
  }
14
}