/*
 * @lc app=leetcode.cn id=11 lang=golang
 *
 * [11] 盛最多水的容器
 */

// @lc code=start
func maxArea(height []int) int {
	maxCapability := 0
	for i := 0; i < len(height)-1; i++ {
		for j := i + 1; j < len(height); j++ {
			capability := (j - i) * min(height[i], height[j])
			maxCapability = max(maxCapability, capability)
		}
	}
	return maxCapability
}

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

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

// @lc code=end

// @lc code=start
func maxArea(height []int) int {
	maxCapability := 0
	left, right := 0, len(height)-1
	for right > left {
		capability := (right - left) * min(height[left], height[right])
		maxCapability = max(maxCapability, capability)
		if height[left] > height[right] {
			right--
		} else {
			left++
		}
	}

	return maxCapability
}

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

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

// @lc code=end