一刷881

Author: diguage

README.adoc

@@ -6192,14 +6192,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/0880-decoded-string-at-index.adoc[题解]
 //|Medium
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/boats-to-save-people/[881. Boats to Save People^]
-//|{source_base_url}/_0881_BoatsToSavePeople.java[Java]
-//|{doc_base_url}/0881-boats-to-save-people.adoc[题解]
-//|Medium
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/boats-to-save-people/[881. Boats to Save People^]
+|{source_base_url}/_0881_BoatsToSavePeople.java[Java]
+|{doc_base_url}/0881-boats-to-save-people.adoc[题解]
+|Medium
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/reachable-nodes-in-subdivided-graph/[882. Reachable Nodes In Subdivided Graph^]
 //|{source_base_url}/_0882_ReachableNodesInSubdividedGraph.java[Java]

docs/0881-boats-to-save-people.adoc

@@ -9,8 +9,6 @@ Each boat carries at most 2 people at the same time, provided the sum of the wei
 
 Return the minimum number of boats to carry every given person.  (It is guaranteed each person can be carried by a boat.)
 
- 
-
 
 *Example 1:*
 
@@ -46,18 +44,39 @@ Return the minimum number of boats to carry every given person.  (It is guarante
 *Note*:
 
 
-* `1 <= people.length <= 50000`
-* `1 <= people[i] <= limit <= 30000`
-
-
+* `1 \<= people.length \<= 50000`
+* `1 \<= people[i] \<= limit \<= 30000`
 
 
+== 思路分析
 
+对数组排序，从两端向中间挤压。
 
+WARNING: 注意审题！一条小船只能坐两个人。
 
 [[src-0881]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0881_BoatsToSavePeople.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0881_BoatsToSavePeople_2.java[tag=answer]
+// ----
+// --
+====
+
+== 参考资料
+
+. https://leetcode.cn/problems/boats-to-save-people/solutions/958838/jiu-sheng-ting-by-leetcode-solution-0nsp/[881. 救生艇 - 官方题解^]
 

docs/index.adoc

@@ -1836,7 +1836,7 @@ include::0876-middle-of-the-linked-list.adoc[leveloffset=+1]
 
 // include::0880-decoded-string-at-index.adoc[leveloffset=+1]
 
-// include::0881-boats-to-save-people.adoc[leveloffset=+1]
+include::0881-boats-to-save-people.adoc[leveloffset=+1]
 
 // include::0882-reachable-nodes-in-subdivided-graph.adoc[leveloffset=+1]
 

logbook/202406.adoc

@@ -904,6 +904,12 @@
 |⭕️ 理解题目，确定符合要求的条件。
 
 
+|{counter:codes}
+|{leetcode_base_url}/boats-to-save-people/[881. Boats to Save People^]
+|{doc_base_url}/0881-boats-to-save-people.adoc[题解]
+|❌ 贪心+双指针
+
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

src/main/java/com/diguage/algo/leetcode/_0881_BoatsToSavePeople.java

@@ -0,0 +1,25 @@
+package com.diguage.algo.leetcode;
+
+import java.util.Arrays;
+
+public class _0881_BoatsToSavePeople {
+  // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-15 23:20:35
+   */
+  public int numRescueBoats(int[] people, int limit) {
+    Arrays.sort(people);
+    int result = 0;
+    int light = 0, heavy = people.length - 1;
+    while (light <= heavy) {
+      if (people[light] + people[heavy] < limit) {
+        light++;
+      }
+      heavy--;
+      result++;
+    }
+    return result;
+  }
+  // end::answer[]
+}