Algorithms—11.Container With Most Water

来源：互联网发布：天涯明月刀情缘知乎编辑：程序博客网时间：2024/05/21 11:28

思路：从外层开始，计算蓄水量，每次移动一格左挡板或者右挡板，移动目前较短的一个。

public class Solution {    public int maxArea(int[] height) {        int left=0;        int right=height.length-1;        int ans=(right-left)*Math.min(height[left], height[right]);        while (right>left) {        int water=(right-left)*Math.min(height[left], height[right]);        if (water>ans) {ans=water;}        if (height[left]<height[right]) {left++;}else {right--;}}        return ans;    }}

0 0

Algorithms—11.Container With Most Water
LeetCode Algorithms 11. Container With Most Water
11.Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11.Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
浅谈XML 解析技术性能对比分析之解析XML
12 个 CSS 高级技巧汇总
全面理解Unity加载和内存管理机制之二：进一步深入和细节
LintCode_子数组之和
mysql 日期转换
Algorithms—11.Container With Most Water
Android EditText 不可编辑到可编辑状态改变
Spring Security教程（1）----SpringSecurity3.2环境搭建
关于防QQ5.0侧滑
关于ios上应用版本更新的一些小结
安卓应用使用QQ登录的申请流程
眼部识别和指纹识别，你会选择谁？
gson转list
每次打开快捷方式时，弹出安全警告的解决办法