markdown-body entry-content container-lg" itemprop="text">

title

subtitle

date

lastmod

draft

author

authorLink

description

license

images

categories

featuredImage

featuredImagePreview

hiddenFromHomePage

hiddenFromSearch

twemoji

lightgallery

ruby

fraction

fontawesome

linkToMarkdown

rssFullText

toc

code

math

mapbox

comment

library

seo

0011.Container With Most Water

https://leetcode.com/problems/container-with-most-water/description/

2024-03-24 16:31:00 +0800

false

Kimi.Tsai

https://kimi0230.github.io/

0011.Container-With-Most-Water

LeetCode

Medium

Container With Most Water

Amazon

Microsoft

Adobe

Facebook

Google

Array

Two Pointers

Greedy

LeetCode

false

true

false

enable	auto
true	true

copy	maxShownLines
true	200

enable

enable
true

enable
true

css	js

images

0011.Container With Most Water

題目

題目大意

解題思路

利用雙指針, 找出最小的高並乘上兩指針距離, 得出面積當左指針高度比右指針高度高時, 將右指針往左移, 反之將左指針往右移.

Big O

時間複雜 : O(n)
空間複雜 : O(1)

來源

解答

https://github.com/kimi0230/LeetcodeGolang/blob/master/Leetcode/0011.Container-With-Most-Water/main.go

package containerwithmostwater

// 時間複雜 O(n), 空間複雜 O(1)
func maxArea(height []int) int {
	left, right := 0, len(height)-1
	result := 0
	for left < right {
		tmp := (right - left) * min(height[left], height[right])
		result = max(result, tmp)
		if height[left] > height[right] {
			right--
		} else {
			left++
		}
	}
	return result
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

0011.Container With Most Water

題目

題目大意

解題思路

Big O

來源

解答

Benchmark