Minimum Cost to Move Chips to The Same Position Solutions in Go

Number 1217

Difficulty Easy

Acceptance 64.3%

Other languages C++

Solutions

Go solution by halfrost/LeetCode-Go

package leetcode

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

func min(a int, b int) int {
	if a > b {
		return b
	}
	return a
}

package leetcode

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

func min(a int, b int) int {
	if a > b {
		return b
	}
	return a
}