011 Container with most water

Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). nvertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines,which together with x-axis forms a container, such that the container contains the most water.
Note: You may not slant the container and n is at least 2

在这里插入图片描述

题目解析链接

代码示例:

package main
//Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n
//vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines,
//which together with x-axis forms a container, such that the container contains the most water.
//Note: You may not slant the container and n is at least 2
import "fmt"

func maxArea(height []int) int {
	max, start, end := 0, 0, len(height)-1
	for start < end {
		width := end - start
		high := 0
		if height[start] < height[end] {
			high = height[start]
			start++
		} else {
			high = height[end]
			end--
		}

		temp := width * high
		fmt.Printf("high=%d,width=%d,temp=%d\n",high,width,temp)
		if temp > max {
			max = temp
		}
	}
	return max
}

func main()  {
	var a = []int{1,8,6,2,5,4,8,3,7}
	fmt.Println(maxArea(a))
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值