一刷904

Author: diguage

README.adoc

@@ -6353,14 +6353,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/0903-valid-permutations-for-di-sequence.adoc[题解]
 //|Hard
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/fruit-into-baskets/[904. Fruit Into Baskets^]
-//|{source_base_url}/_0904_FruitIntoBaskets.java[Java]
-//|{doc_base_url}/0904-fruit-into-baskets.adoc[题解]
-//|Medium
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/fruit-into-baskets/[904. Fruit Into Baskets^]
+|{source_base_url}/_0904_FruitIntoBaskets.java[Java]
+|{doc_base_url}/0904-fruit-into-baskets.adoc[题解]
+|Medium
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/sort-array-by-parity/[905. Sort Array By Parity^]
 //|{source_base_url}/_0905_SortArrayByParity.java[Java]

docs/0000-08-sliding-window.adoc

@@ -83,3 +83,4 @@ while (right < s.size()) {
 . https://mp.weixin.qq.com/s/6YeZUCYj5ft-OGa85sQegw[面试官，你再问我滑动窗口问题试试？我有解题模板，不怕！^]
 . https://www.bilibili.com/video/BV1hd4y1r7Gq/[滑动窗口【基础算法精讲 03】^]
 . https://leetcode.cn/problems/subarray-product-less-than-k/solutions/1320871/jian-dan-yi-dong-xiang-xi-zhu-jie-shuang-jvy3/[713. 乘积小于 K 的子数组 - 官方思路秒懂○注释详细○双指针滑窗 【附通用滑窗模板】^]
+. https://leetcode.cn/problems/fruit-into-baskets/solutions/1437444/shen-du-jie-xi-zhe-dao-ti-he-by-linzeyin-6crr/[904. 水果成篮 - 【深度解析】这道题和76. 最小覆盖子串的区别^] -- 这个题解比较了“最大滑动窗口”和“最小滑动窗口”的区别。可以研究一下。

docs/0904-fruit-into-baskets.adoc

@@ -70,10 +70,10 @@ If we started at the first tree or the eighth tree, we would only collect 4 frui
 *Note:*
 
 
-. `1 <= tree.length <= 40000`
-. `0 <= tree[i] < tree.length`
-
+. `1 \<= tree.length \<= 40000`
+. `0 \<= tree[i] \< tree.length`
 
+== 思路分析
 
 
 [[src-0904]]
@@ -82,3 +82,9 @@ If we started at the first tree or the eighth tree, we would only collect 4 frui
 include::{sourcedir}/_0904_FruitIntoBaskets.java[tag=answer]
 ----
 
+== 参考资料
+
+. https://leetcode.cn/problems/fruit-into-baskets/solutions/1893352/shui-guo-cheng-lan-by-leetcode-solution-1uyu/[904. 水果成篮 - 官方题解^]
+. https://leetcode.cn/problems/fruit-into-baskets/solutions/1437444/shen-du-jie-xi-zhe-dao-ti-he-by-linzeyin-6crr/[904. 水果成篮 - 【深度解析】这道题和76. 最小覆盖子串的区别^]
+. https://leetcode.cn/problems/fruit-into-baskets/solutions/1897490/by-ac_oier-skgk/[904. 水果成篮 - 【宫水三叶】简单滑动窗口运用题^]
+

docs/index.adoc

@@ -1882,7 +1882,7 @@ include::0892-surface-area-of-3d-shapes.adoc[leveloffset=+1]
 
 // include::0903-valid-permutations-for-di-sequence.adoc[leveloffset=+1]
 
-// include::0904-fruit-into-baskets.adoc[leveloffset=+1]
+include::0904-fruit-into-baskets.adoc[leveloffset=+1]
 
 // include::0905-sort-array-by-parity.adoc[leveloffset=+1]
 

logbook/202406.adoc

@@ -893,6 +893,12 @@
 |{doc_base_url}/1110-delete-nodes-and-return-forest.adoc[题解]
 |✅ 递归+深度优先
 
+|{counter:codes}
+|{leetcode_base_url}/fruit-into-baskets/[904. Fruit Into Baskets^]
+|{doc_base_url}/0904-fruit-into-baskets.adoc[题解]
+|✅ 滑动窗口
+
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

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

@@ -0,0 +1,39 @@
+package com.diguage.algo.leetcode;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _0904_FruitIntoBaskets {
+  // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-27 15:33:58
+   */
+  public int totalFruit(int[] fruits) {
+    int result = 0;
+    int head = 0, tail = 0;
+    Map<Integer, Integer> fruitToCntMap = new HashMap<>();
+    while (head < fruits.length) {
+      int f1 = fruits[head];
+      head++;
+      Integer cnt = fruitToCntMap.getOrDefault(f1, 0);
+      fruitToCntMap.put(f1, cnt + 1);
+      if (fruitToCntMap.size() <= 2) {
+        result = Math.max(result, head - tail);
+      } else {
+        while (tail < head && fruitToCntMap.size() > 2) {
+          int f2 = fruits[tail];
+          Integer c2 = fruitToCntMap.get(f2);
+          if (c2 >1) {
+            fruitToCntMap.put(f2, c2 - 1);
+          }else {
+            fruitToCntMap.remove(f2);
+          }
+          tail++;
+        }
+      }
+    }
+    return result;
+  }
+  // end::answer[]
+}