Container With Most Water
题意是有个高度数组，就相当于隔板的高度，求数组中任意两隔板间盛水的最大量。隔板间的距离与较低隔板的高度乘积即为盛水的容量。 int maxArea(vector<int> &height) { int ...
原文：container-with-most-water（最大蓄水问题）
题目描述： Given n non negative integers a , a , ..., 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, . Find two ...
2018-06-12 16:10 1 2154 推荐指数：
相关推荐
[LeetCode] Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). ...
LeetCode:Container With Most Water,Trapping Rain Water
Container With Most Water 题目链接 Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines ...
[leetcode]Container With Most Water @ Python
原题地址：https://oj.leetcode.com/problems/container-with-most-water/ 题意： Given n non-negative integers a1, a2, ..., an, where each represents a point ...
LeetCode 笔记系列二 Container With Most Water
题目：Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai ...
刷题11. Container With Most Water
一、题目说明 11.Container With Most Water，这个题目难度是Medium。 二、我的做法 乍一看，简单啊，两个for循环就可以了，我在本地写的。 提交后运行，居然Time Limit Exceeded是，好伤心。 里面给了一个非常长的数据，实际上我本地 ...
LeetCode 11. 盛最多水的容器（Container With Most Water）
题目描述 给定 n 个非负整数 a1，a2，...，an，每个数代表坐标中的一个点 (i, ai) 。画 n 条垂直线，使得垂直线 i 的两个端点分别为 (i, ai) 和 (i ...
[LeetCode] 11. Container With Most Water 装最多水的容器
Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, a ...