LeetCode知识点总结 - 881

最新推荐文章于 2024-02-14 18:55:42 发布

jeeeee_no

最新推荐文章于 2024-02-14 18:55:42 发布

阅读量387

点赞数 7

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

本文链接：https://blog.csdn.net/m0_59773145/article/details/135819396

版权

LeetCode 专栏收录该内容

417 篇文章 1 订阅

订阅专栏

LeetCode 881. Boats to Save People

考点	难度
Greedy	Easy

题目

You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of limit. Each boat carries at most two people at the same time, provided the sum of the weight of those people is at most limit.

Return the minimum number of boats to carry every given person.

思路

two pointers low和high，从小到大sort array，把最小的和最大的配对，如果sum可以在一条船里boat和low加一high减一，否则high只能自己在一条船，所以boat加一high减一

答案

class Solution:
    def numRescueBoats(self, people, limit):
        people.sort()
        lo = 0
        hi = len(people)-1
        boats = 0
        while lo <= hi:
            if people[lo] + people[hi] <= limit:
                lo += 1
                hi -= 1
            else:
                hi -= 1
            boats += 1
        return boats