Search

Boats to Save People

The i-th person has weight people[i], and each boat can carry a maximum weight of limit. Each boat carries at most 2 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. (It is guaranteed each person can be carried by a boat.)


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)

Note:

  • 1 <= people.length <= 50000

  • 1 <= people[i] <= limit <= 30000

Solution:

class Solution {
    public int numRescueBoats(int[] people, int limit) {
        Arrays.sort(people);
        int light=0,heavy=people.length-1;
        int boats=0;
        while(light<=heavy)
        {
            if(people[light]+people[heavy]<=limit)
            {
                light++;
                heavy--;
                boats++;
            }
            else
            {
                heavy--;
                boats++;
            }
        }
        
        return boats;
    }
}




11 views0 comments

Recent Posts

See All

A string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum number of characters you need to delete to make s good. The f

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.