Minimum Cost to Move Chips to The Same Position LeetCode solution in C++

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