Leetcode 1217. Minimum Cost to Move Chips to The Same Position [Python]

题目好难理解，看了各位大神们的解释才懂了要求做什么。比如说[2,2,2,3,3] 的意思是[index == 2的位置上有一个chip,index == 2的位置上有一个chip,index == 2的位置上有一个chip, index == 3的位置上有一个chip, index == 3的位置上有一个chip]. 那其实问题就成了，奇数index上的chips，无论挪到哪里都是不cost的，因为每次挪2位。同理，偶数index上的chips也一样。问题就成了，把奇数位上的全部chips挪到同一个奇数位上，把偶数位上的全部chips挪到同一个偶数位上，其这两个位置相邻。最后看哪位上的chips少，就把少的挪到多的上。

class Solution:def minCostToMoveChips(self, position: List[int]) -> int:evenpos = 0totalchips = len(position)for index, pos in enumerate(position):if pos % 2 == 0:evenpos += 1oddpos = totalchips - evenposreturn min(oddpos, evenpos)

Leetcode 1217. Minimum Cost to Move Chips to The Same Position [Python]相关推荐

leetcode 1217. Minimum Cost to Move Chips to The Same Position | 1217. 玩筹码（Java）
题目题解所有的 chips,要么在奇数位置,要么在偶数位置 class Solution {public int minCostToMoveChips(int[] position) {int p ...
leetcode 983. Minimum Cost For Tickets | 983. 最低票价（动态规划）
题目 https://leetcode.com/problems/minimum-cost-for-tickets/ 题解没想出来,看了官方题解,难点在于如何列出 dp 的状态转移方程.我没想到它的 ...
leetcode 1217. Play with Chips 解法 python
一.问题描述 There are some chips, and the i-th chip is at position chips[i]. You can perform any of the t ...
【LeetCode 1000】 Minimum Cost to Merge Stones
题目描述 There are N piles of stones arranged in a row. The i-th pile has stones[i] stones. A move consi ...
LeetCode 746. Min Cost Climbing Stairs--动态规划--Java,C++,Python解法
题目地址:Min Cost Climbing Stairs - LeetCode LeetCode 动态规划(Dynamic programming)系列题目:LeetCode 动态规划(Dynami ...
[费用流专题]Going Home，Minimum Cost，工作安排
文章目录 T1:Going Home 题目题解 CODE T2:Minimum Cost 题目题解 CODE T3:工作安排题解 CODE T1:Going Home 题目 On a grid ...
[Swift]LeetCode1135. 最低成本联通所有城市 | Connecting Cities With Minimum Cost
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ ➤微信公众号:山青咏芝(shanqingyongzhi) ➤博客园地址:山青咏芝(https://www.cnblog ...
POJ 2516 -- Minimum Cost （最小费用最大流，必须分开建图）
题目链接 Description Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In ...
【LeetCode】Minimum Depth of Binary Tree 二叉树的最小深度 java
[LeetCode]Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum dept ...

Leetcode 1217. Minimum Cost to Move Chips to The Same Position [Python]

Leetcode 1217. Minimum Cost to Move Chips to The Same Position [Python]相关推荐

最新文章

热门文章