python3 解法, 执行用时: 32 ms, 内存消耗: 14.8 MB, 提交时间: 2022-07-08 16:51:10

class Solution:
    def minCostToMoveChips(self, position: List[int]) -> int:
        even, odd = 0, 0
        for p in position:
            if p % 2 == 0:
                even += 1
            else:
                odd += 1
        
        return min(even, odd)

golang 解法, 执行用时: 0 ms, 内存消耗: 2.1 MB, 提交时间: 2021-06-11 10:55:17

func minCostToMoveChips(position []int) int {
    even, odd := 0, 0
    for _, p := range position {
        if p % 2 == 0 {
            even++
        } else {
            odd++
        }
    }
    if even > odd {
        return odd
    }
    return even
}