标签：style blog http color os io ar strong for
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.
int maxArea(vector<int> &height) { // Start typing your C/C++ solution below // DO NOT write int main() function int i = 0; int j = height.size() - 1; int ret = 0; while(i < j) { int area = (j - i) * min(height[i], height[j]); ret = max(ret, area); if (height[i] <= height[j]) i++; else j--; } return ret; }
标签：style blog http color os io ar strong for
原文地址：http://www.cnblogs.com/zhhwgis/p/3960448.html
