LeetCode/11.cpp at master · nitin-maharana/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

class Solution {
public:
    int maxArea(vector<int>& height) {
        int l, r, maxArea, currArea;

        l = 0;
        r = height.size()-1;
        maxArea = 0;

        while(l < r)
        {
            currArea = (r-l) * min(height[l], height[r]);

            maxArea =  (currArea > maxArea) ? currArea : maxArea;

            if(height[l] > height[r])
            {
                r--;

                while((l < r) && (height[r] < height[r+1]))
                    r--;
            }
            else
            {
                l++;

                while((l < r) && (height[l] < height[l-1]))
                    l++;
            }
        }

        return maxArea;
    }
};