Leetcode 11: Container With Most Water
2015-12-15 06:19
447 查看
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.
Solution:
Use two pointers. Set start pointer at index 0 and end at height.length - 1. The height is always the smaller one of start and end and the width is end - start. The volume is height * width. Then to find a larger volume while narrowing the width, we should
consider to increase the height after each move. So we should move the pointer with smaller value and try to update the volume until start equals to end.
Time complexity: O(n)
Space complexity: O(1)
<p>public class Solution {
public int maxArea(int[] height) {
int length = height.length;
int volume = Integer.MIN_VALUE;
if (height == null || length == 0) {
return 0;
}
// Two pointers
int i = 0;
int j = length - 1;
while (i < j) {
int wid = j - i;
int hei = Math.min(height[i], height[j]);
volume = Math.max(volume, wid * hei);
if (height[i] <= height[j]) {
i++;
} else {
j--;
}
}
return volume;
}
}
</p>
..., 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.
Solution:
Use two pointers. Set start pointer at index 0 and end at height.length - 1. The height is always the smaller one of start and end and the width is end - start. The volume is height * width. Then to find a larger volume while narrowing the width, we should
consider to increase the height after each move. So we should move the pointer with smaller value and try to update the volume until start equals to end.
Time complexity: O(n)
Space complexity: O(1)
<p>public class Solution {
public int maxArea(int[] height) {
int length = height.length;
int volume = Integer.MIN_VALUE;
if (height == null || length == 0) {
return 0;
}
// Two pointers
int i = 0;
int j = length - 1;
while (i < j) {
int wid = j - i;
int hei = Math.min(height[i], height[j]);
volume = Math.max(volume, wid * hei);
if (height[i] <= height[j]) {
i++;
} else {
j--;
}
}
return volume;
}
}
</p>
相关文章推荐
- 解析从源码分析常见的基于Array的数据结构动态扩容机制的详解
- javascript数组操作总结和属性、方法介绍
- mysql_fetch_assoc和mysql_fetch_row的功能加起来就是mysql_fetch_array
- JavaScript Array扩展实现代码
- JavaScript之数组(Array)详解
- C#中Array与ArrayList用法及转换的方法
- Array栈方法和队列方法的特点说明
- Array.prototype.slice 使用扩展
- Array, Array Constructor, for in loop, typeof, instanceOf
- 实例详解ECMAScript5中新增的Array方法
- js Array的用法总结
- JavaScript 判断判断某个对象是Object还是一个Array
- Javascript中的Array数组对象详谈
- js模拟实现Array的sort方法
- 在javascript将NodeList作为Array数组处理的方法
- PHP array_multisort()函数的使用札记
- PHP中array_merge和array相加的区别分析
- Sorting Array Values in PHP(数组排序)
- 深入array multisort排序原理的详解
- Array 重排序方法和操作方法的简单实例