LeetCode881. Boats to Save People

最新推荐文章于 2024-10-14 09:08:48 发布

叶卡捷琳堡

最新推荐文章于 2024-10-14 09:08:48 发布

阅读量475

点赞数 7

文章标签：算法数据结构 leetcode c++

本文链接：https://blog.csdn.net/weixin_46841376/article/details/135671235

版权

这篇文章讨论了一个编程问题，如何在满足每艘船最多承载两人且总重量不超过限制的情况下，使用最少的船数将所有人运送到安全地点。给出了一个Solution类的示例代码来解决这个问题，通过排序和双指针法找到最优解。

摘要由CSDN通过智能技术生成

文章目录

- 一、题目
- 二、题解

一、题目

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.

Example 1:

Input: people = [1,2], limit = 3
Output: 1
Explanation: 1 boat (1, 2)
Example 2:

Input: people = [3,2,2,1], limit = 3
Output: 3
Explanation: 3 boats (1, 2), (2) and (3)
Example 3:

Input: people = [3,5,3,4], limit = 5
Output: 4
Explanation: 4 boats (3), (3), (4), (5)

Constraints:

1 <= people.length <= 5 * 104
1 <= people[i] <= limit <= 3 * 104

二、题解

class Solution {
public:
    int numRescueBoats(vector<int>& people, int limit) {
        int res = 0;
        sort(people.begin(),people.end());
        int l = 0,r = people.size() - 1;
        while(l <= r){
            int sum = l == r ? people[l] : people[l] + people[r];
            if(sum > limit) r--;
            else if(sum <= limit) l++,r--;
            res++;
        }
        return res;
    }
};