LeetCode知识点总结 - 1029

jeeeee_no

于 2024-02-01 18:44:37 发布

阅读量230

点赞数 2

分类专栏： LeetCode 文章标签： leetcode 算法职场和发展

本文链接：https://blog.youkuaiyun.com/m0_59773145/article/details/135980382

版权

LeetCode 专栏收录该内容

417 篇文章

订阅专栏

本文介绍了解决LeetCode1029题——TwoCityScheduling的算法，使用贪心策略，计算每个人员从一个城市飞往另一个城市的退款，并按顺序选择最小值，以实现每座城市恰好有n人到达时的最低总飞行成本。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

LeetCode 1029. Two City Scheduling

考点	难度
Greedy	Easy

题目

A company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the ith person to city a is aCosti, and the cost of flying the ith person to city b is bCosti.

Return the minimum cost to fly every person to a city such that exactly n people arrive in each city.

思路

先假设都飞到第一个城市，然后用第二个城市-第一个城市计算refund list，sort list，选最小的。

答案

class Solution:
    def twoCitySchedCost(self, costs):
        refund = []
        N = len(costs)//2
        minCost = 0
        for A, B in costs:
            refund.append(B - A)
            minCost += A
        refund.sort()
        for i in range(N):
            minCost += refund[i]
        return minCost