LeetCode 1217. Minimum Cost to Move Chips to The Same Position (Easy)
Wehavenchips,wherethepositionoftheithchipisposition[i].Weneedtomoveallthechipstothesameposition.Inonestep,wecanchangethepositionoftheithchipfromposition[i]to:position[i]+2orposition[i]-2withcost=0.pos