works/solutions/leetcode/cpp/11.cpp


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
40
41
42

#include <vector>
#include <algorithm>

using std::vector;

class Solution
{
public:
    int maxArea(vector<int> &height)
    {
        auto left = height.cbegin();
        auto right = height.cend();
        --right;

        int result = 0;

        // although length could be calculated by right - left,
        // but this can be cached in register.
        int length = height.size() - 1;

        while (left != right)
        {
            const int left_v = *left;
            const int right_v = *right;
            const int capacity = std::min(left_v, right_v) * length;
            result = std::max(capacity, result);

            if (left_v < right_v)
            {
                ++left;
            }
            else
            {
                --right;
            }

            length--;
        }

        return result;
    }
};