feat: 增加 11. 盛最多水的容器

docs/.vitepress/config.ts

@@ -64,6 +64,7 @@ export default defineConfig({
           { text: '6. Z 字形变换', link: '/leetcode/zigzagConversion' },
           { text: '7. 整数反转', link: '/leetcode/reverseInteger' },
           { text: '9. 回文数', link: '/leetcode/palindromeNumber' },
+          { text: '11. 盛最多水的容器', link: '/leetcode/containerWithMostWater' },
           { text: '83. 删除排序链表中的重复元素', link: '/leetcode/removeDuplicatesFromSortedList' },
           { text: '2085. 统计出现过一次的公共字符串', link: '/leetcode/countCommonWordsWithOneOccurrence' },
           { text: '2182. 构造限制重复的字符串', link: '/leetcode/constructStringWithRepeatLimit' },

docs/leetcode/containerWithMostWater.md

@@ -0,0 +1,12 @@
+# 11. 盛最多水的容器
+
+[11. 盛最多水的容器](https://leetcode.cn/problems/container-with-most-water/description/)
+
+## 代码
+
+::: code-group
+
+<<< ../../src/leetcode/containerWithMostWater/javascript.js{javascript} [javascript]
+<<< ../../src/leetcode/containerWithMostWater/typescript.ts{typescript} [typescript]
+
+:::

src/leetcode/containerWithMostWater/javascript.js

@@ -0,0 +1,20 @@
+// 输入：[1,8,6,2,5,4,8,3,7]
+// 输出：49
+
+export function maxArea(height) {
+  if (!height.length || height.length === 1) return 0
+  let max = 0
+  let l = 0
+  let r = height.length - 1
+  max = (r - l) * Math.min(height[l], height[r])
+  while (l < r) {
+    if (height[l] < height[r]) {
+      l++
+    } else {
+      r--
+    }
+    const area = (r - l) * Math.min(height[l], height[r])
+    if (max < area) max = area
+  }
+  return max
+}

src/leetcode/containerWithMostWater/typescript.ts

@@ -0,0 +1,31 @@
+// 输入：[1,8,6,2,5,4,8,3,7]
+// 输出：49
+
+// function maxArea(height: number[]): number {
+//   if (!height.length || height.length === 1) return 0
+//   for (let i = 0; i < height.length; i++) {
+//       for (let j = i + 1; j < height.length; j++) {
+//           const area = (j - i) * Math.min(height[i], height[j])
+//           if (max < area) max = area 
+//       }
+//   }
+//   return max
+// }
+
+export function maxArea(height: number[]): number {
+  if (!height.length || height.length === 1) return 0
+  let max = 0
+  let l = 0
+  let r = height.length - 1
+  max = (r - l) * Math.min(height[l], height[r])
+  while (l < r) {
+    if (height[l] < height[r]) {
+      l++
+    } else {
+      r--
+    }
+    const area = (r - l) * Math.min(height[l], height[r])
+    if (max < area) max = area
+  }
+  return max
+}

src/leetcode/palindromeNumber/javascript.js

@@ -1,3 +1,6 @@
+// 输入：x = 121
+// 输出：true
+
 export function isPalindrome(x) {
   if (x < 0) return false
   let num = x

src/leetcode/palindromeNumber/typescript.ts

@@ -1,3 +1,6 @@
+// 输入：x = 121
+// 输出：true
+
 export function isPalindrome(x: number): boolean {
   if (x < 0) return false
   let num = x

test/containerWithMostWater.test.ts

@@ -0,0 +1,7 @@
+import { expect, test } from 'vitest'
+import { maxArea } from '../src/leetcode/containerWithMostWater/typescript.ts'
+
+
+test(`[1,8,6,2,5,4,8,3,7]`, () => {
+  expect(maxArea([1,8,6,2,5,4,8,3,7])).toBe(49)
+})