# 881.Boats-to-Save-People

## 881. Boats to Save People

## 题目地址

<https://leetcode.com/problems/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)
```

## 代码

### Approach 1: Greedy (two pointer)

**Complexity Analysis**

* Time Complexity: &#x4F;*(*&#x4E;*log*N), where N is the length of `people`.
* Space Complexity: O(N).

```java
class Solution {
  public int numRescueBoats(int[] people, int limit) {
        Arrays.sort(people);     // O(nlogn)
    int i = 0, j = people.length - 1;
    int ans = 0;

    while (i <= j) {
      ans++;
      if (people[i] + people[j] <= limit) {
        i++;
      }
      j--;
    }

    return ans;
  }
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://wentao-shao.gitbook.io/leetcode/array/881.boats-to-save-people.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.