11. Container With Most Water
2017-12-23 08:40
471 查看
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.
Note: You may not slant the container and n is at least 2.
时间复杂度O(n2) class Solution { public int maxArea(int[] height) { int l = 0; int area = 0; for (int i = 0; i < height.length - 1; i++) { for (int j = i; j < height.length; j++) { area = Math.max(area, Math.abs((j - i) * Math.min(height[j], height[i]))); } } return area; } }
相关文章推荐
- Leetcode 11 Container With Most Water
- 11. Container With Most Water
- Leetcode 11[medium]--Container With Most Water
- 【leetcode】【11】Container With Most Water
- LeetCode 11 Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- 11. Container With Most Water
- Leetcode 11-Container With Most Water
- 11 Container With Most Water
- leetcode-11-Container With Most Water
- 11、Container with most water
- LeetCode-11 Container With Most Water(容器装水最大量)
- LeetCode 11 Container With Most Water
- 11. Container With Most Water LeetCode题解
- LeetCode 11 - Container With Most Water
- Leet Code 11 Container With Most Water - Java
- LeetCode(11) ContainerWithMostWater
- leetcode之11. Container With Most Water(C++解法)
- 11. Container With Most Water