三刷11

Author: diguage

docs/0011-container-with-most-water.adoc

@@ -49,6 +49,15 @@ include::{sourcedir}/_0011_ContainerWithMostWater.java[tag=answer]
 include::{sourcedir}/_0011_ContainerWithMostWater_2.java[tag=answer]
 ----
 --
+
+三刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0011_ContainerWithMostWater_3.java[tag=answer]
+----
+--
 ====
 
 == 参考资料

logbook/202406.adoc

@@ -650,6 +650,11 @@
 |{doc_base_url}/0064-minimum-path-sum.adoc[题解]
 |✅动态规划
 
+|{counter:codes}
+|{leetcode_base_url}/container-with-most-water/[11. Container With Most Water^]
+|{doc_base_url}/0011-container-with-most-water.adoc[题解]
+|⭕️双指针+贪心
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

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

@@ -0,0 +1,25 @@
+package com.diguage.algo.leetcode;
+
+public class _0011_ContainerWithMostWater_3 {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-16 19:38:05
+   */
+  public int maxArea(int[] height) {
+    int result = 0;
+    int left = 0, right = height.length - 1;
+    while (left < right) {
+      result = Math.max(result,
+        Math.min(height[left], height[right]) * (right - left - 1));
+      if (height[left] < height[right]) {
+        left++;
+      } else {
+        right--;
+      }
+    }
+    return result;
+  }
+  // end::answer[]
+}