Eric 的小站

1
class Solution {
2
public:
3
    int maxArea(vector<int>& height) {
4
        int index_left = 0,index_right = 0,max_area = 0;
5
        int front = 0,rear = height.size()-1;
6
        while(front!=rear){
7
            int area = min(height[front],height[rear])*(rear-front);
8
            if(area>max_area) max_area=area;
9
            if(height[front]>height[rear]){
10
                rear--;
11
            }else{
12
                front++;
13
            }
14
        }
15
        return max_area;
16
    }
17
};