标签：style blog color os io for ar div
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.
暴力超时。网上的算法，左右两指针。。。
1 class Solution { 2 public: 3 int maxArea(vector<int> &height) { 4 int i = 0, j = height.size() - 1, water, max = 0; 5 while (i < j) { 6 if (height[i] < height[j]) { 7 water = (j - i) * height[i]; 8 i++; 9 } else { 10 water = (j - i) * height[j]; 11 j--; 12 } 13 if (water > max) max = water; 14 } 15 return max; 16 } 17 };
Leetcode | Container With Most Water,布布扣,bubuko.com
Leetcode | Container With Most Water
标签：style blog color os io for ar div
原文地址：http://www.cnblogs.com/linyx/p/3892838.html
