Skip to content

Latest commit

 

History

History
16 lines (12 loc) · 731 Bytes

Day39_LeetCode881.md

File metadata and controls

16 lines (12 loc) · 731 Bytes

Day 39: LeetCode 881 [Boats to Save People]

Problem Description: 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)

Link to LeetCode Problem: https://leetcode.com/problems/boats-to-save-people/description/

not the best solution... image