leetcode-11-Container With Most Water

At first I thought I use the greedy: the move left pointer if the new one has longer height which can counteract the width, and use the same for right pointer. But it works not well, because maybe I set the rule too strictly. And also maybe the consequence to move pointers may arbitrary.

So when I look at the solution, it loose the constrain and move the pointers base on current situation. Instead of first move to left pointer then move right pointer, we choose which one to move base on current location and height, and do not need to check the width, since maybe such local optimal maybe lead to global optimal.

I think theoretically is because in my first attempt, the local optimal cannot lead to global optimal, while the solution can do it.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值