🥉

Minimum Cost to Move Chips to The Same Position

Created

2021/12/06 07:31

문제 번호

1217

카테고리

Array

Math

Greedy

Minimum Cost to Move Chips to The Same Position - LeetCode

We have n chips, where the position of the chip is position[i]. We need to move all the chips to the same position. In one step, we can change the position of the chip from position[i] to: Return the minimum cost needed to move all the chips to the same position.

https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/

Code

제출 날짜	시간	메모리
2021/12/06	0 ms	2.2 MB

// 1217. Minimum Cost to Move Chips to The Same Position
//
// https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/
//
//	Moving 2 steps == 0 cost
//	Moving 1 step == 1 cost
//	+, - direction possible
//	What is the minimum cost?

// minCostToMoveChips function finds the minimum cost to make the chips the same position.
//
// Main logic is based on the parity of the position due to same parity has no cost.
//
// Thus, smaller value of the count for the parity will be the answer.
func minCostToMoveChips(position []int) int {
	var cnt int
	for _, number := range position {
		if number%2 == 1 {
			cnt++
		}
	}
	if cnt > len(position)-cnt {
		return len(position) - cnt
	} else {
		return cnt
	}
}
Go
복사