LeetCode之Container With Most Water

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.

O(n)算法：贪心算法，首尾指针往中间走，好好体会！

class Solution {
public:
    int maxArea(vector<int> &height) {
        if (height.size() == 0 || height.size() == 1)
			return 0;
		int maxarea = 0;
		for (vector<int>::iterator iterb = height.begin(), itere = height.end()-1;iterb<itere;){
	        int tmp=min(*iterb,*itere)*(itere-iterb);
	        if(tmp>maxarea) 
	            maxarea=tmp;
	        if(*iterb<*itere)
	            iterb++;
	        else 
	            itere--;
		}
		return maxarea;
    }
    
    int min(int a,int b){return a>b?b:a;}
};