1217. Minimum Cost to Move Chips to The Same Position -with java- (leetcode.com)

Solution.java

/*
Your memory usage beats 74.60 % of java submissions.
*/
class Solution {
    public int min(int a, int b){
        if (a<b){
            return a;
        }
        return b;
    }
    public int minCostToMoveChips(int[] position) {
        int[] counter = {0,0};
        for( int i = 0 ; i < position.length ; i++){
            
            if(position[i]%2==0){
                counter[1]++;
            }
            else{
                counter[0]++;
            }
        }
        return min(counter[0],counter[1]);
        
    }
}