Container With Most Water
来源:互联网 发布:php 房源管理系统 编辑:程序博客网 时间:2024/06/06 18:48
题目
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.
解题思路
面积只看边界的两条线,和中间的线没关系。两个指针i,j分别指向头和尾,如果头小,i++,否则j++。
代码
public class Solution { public int maxArea(int[] height){int i=0;int j=height.length-1;int max=0;while(j>i){int tmp=height[i]<=height[j]?height[i]:height[j];if(tmp*(j-i)>max)max=tmp*(j-i);if(height[i]<=height[j])++i;else--j;}return max;}}
运行结果
0 0
- Container With Most Water
- Container with most water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- Container With Most Water
- excel 宏(VB)实现复制一列并按第二列的单元格长度排序
- excel减肥过滤广告
- 合并子目录所有文本文件的批处理
- [机器学习] Adaboost算法流程及原理推导
- LeetCode 题解(272) : Zigzag Iterator
- Container With Most Water
- 张益唐的有用性
- Android ViewPager前两页显示空白
- LeetCode 题解(273) : Wiggle Sort
- LeetCode 题解(274) : Two Sum II - Input array is sorted
- *LeetCode-Longest Valid Parentheses
- Leetcode NO.125 Valid Palindrome
- 2048最高分
- 循环队列实现